Base | Representation |
---|---|
bin | 10000010000001… |
… | …100011011000101 |
3 | 201000002121112011 |
4 | 100100030123011 |
5 | 1024301240040 |
6 | 43020254221 |
7 | 6520514206 |
oct | 2020143305 |
9 | 630077464 |
10 | 272680645 |
11 | 12aa15006 |
12 | 773a1371 |
13 | 44653cc3 |
14 | 283015ad |
15 | 18e143ea |
hex | 1040c6c5 |
272680645 has 4 divisors (see below), whose sum is σ = 327216780. Its totient is φ = 218144512.
The previous prime is 272680637. The next prime is 272680669. The reversal of 272680645 is 546086272.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 158810404 + 113870241 = 12602^2 + 10671^2 .
It is a cyclic number.
It is not a de Polignac number, because 272680645 - 23 = 272680637 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 272680598 and 272680607.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27268060 + ... + 27268069.
It is an arithmetic number, because the mean of its divisors is an integer number (81804195).
Almost surely, 2272680645 is an apocalyptic number.
It is an amenable number.
272680645 is a deficient number, since it is larger than the sum of its proper divisors (54536135).
272680645 is an equidigital number, since it uses as much as digits as its factorization.
272680645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54536134.
The product of its (nonzero) digits is 161280, while the sum is 40.
The square root of 272680645 is about 16513.0446920003. The cubic root of 272680645 is about 648.4623575258.
The spelling of 272680645 in words is "two hundred seventy-two million, six hundred eighty thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.002 sec. • engine limits •