Base | Representation |
---|---|
bin | 110100100101101100… |
… | …011110001000000000 |
3 | 12101202021121021120000 |
4 | 310211230132020000 |
5 | 1411121022131233 |
6 | 41535055320000 |
7 | 4036206330513 |
oct | 644554361000 |
9 | 171667537500 |
10 | 56466989568 |
11 | 21a47164030 |
12 | ab3a820000 |
13 | 542b803582 |
14 | 2a39580d7a |
15 | 17074c4d13 |
hex | d25b1e200 |
56466989568 has 400 divisors, whose sum is σ = 188407628640. Its totient is φ = 16688332800.
The previous prime is 56466989567. The next prime is 56466989581. The reversal of 56466989568 is 86598966465.
56466989568 is a `hidden beast` number, since 56 + 4 + 6 + 6 + 9 + 8 + 9 + 568 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is a junction number, because it is equal to n+sod(n) for n = 56466989496 and 56466989505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56466989567) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 18702363 + ... + 18705381.
Almost surely, 256466989568 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 56466989568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94203814320).
56466989568 is an abundant number, since it is smaller than the sum of its proper divisors (131940639072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56466989568 is a wasteful number, since it uses less digits than its factorization.
56466989568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3101 (or 3076 counting only the distinct ones).
The product of its digits is 671846400, while the sum is 72.
The spelling of 56466989568 in words is "fifty-six billion, four hundred sixty-six million, nine hundred eighty-nine thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •