Base | Representation |
---|---|
bin | 100000111011100… |
… | …100111011000000 |
3 | 1102111121022221020 |
4 | 200323210323000 |
5 | 2112414114030 |
6 | 130453425440 |
7 | 16456035024 |
oct | 4073447300 |
9 | 1374538836 |
10 | 552488640 |
11 | 263957990 |
12 | 13503b280 |
13 | 8a602172 |
14 | 5353a384 |
15 | 33785510 |
hex | 20ee4ec0 |
552488640 has 224 divisors, whose sum is σ = 1934724096. Its totient is φ = 132464640.
The previous prime is 552488621. The next prime is 552488641. The reversal of 552488640 is 46884255.
It is a junction number, because it is equal to n+sod(n) for n = 552488592 and 552488601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (552488641) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1193049 + ... + 1193511.
Almost surely, 2552488640 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 552488640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (967362048).
552488640 is an abundant number, since it is smaller than the sum of its proper divisors (1382235456).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
552488640 is a wasteful number, since it uses less digits than its factorization.
552488640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 607 (or 597 counting only the distinct ones).
The product of its (nonzero) digits is 307200, while the sum is 42.
The square root of 552488640 is about 23505.0768984064. The cubic root of 552488640 is about 820.5551663856. Note that the first 3 decimals are identical.
The spelling of 552488640 in words is "five hundred fifty-two million, four hundred eighty-eight thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •