Base | Representation |
---|---|
bin | 110101000011000110… |
… | …000000111011000000 |
3 | 12110000122201020022111 |
4 | 311003012000323000 |
5 | 1413123304144320 |
6 | 42100035145104 |
7 | 4054345631542 |
oct | 650306007300 |
9 | 173018636274 |
10 | 56960224960 |
11 | 2217a620091 |
12 | b057a45194 |
13 | 54a9a5a632 |
14 | 2a84c95692 |
15 | 1735953a5a |
hex | d43180ec0 |
56960224960 has 112 divisors (see below), whose sum is σ = 144546011136. Its totient is φ = 21329656832.
The previous prime is 56960224883. The next prime is 56960224967. The reversal of 56960224960 is 6942206965.
It is a happy number.
It is a hoax number, since the sum of its digits (49) coincides with the sum of the digits of its distinct prime factors.
It is not an unprimeable number, because it can be changed into a prime (56960224967) 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 15 ways as a sum of consecutive naturals, for example, 263589 + ... + 428251.
Almost surely, 256960224960 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 56960224960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72273005568).
56960224960 is an abundant number, since it is smaller than the sum of its proper divisors (87585786176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56960224960 is a wasteful number, since it uses less digits than its factorization.
56960224960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164750 (or 164740 counting only the distinct ones).
The product of its (nonzero) digits is 1399680, while the sum is 49.
The spelling of 56960224960 in words is "fifty-six billion, nine hundred sixty million, two hundred twenty-four thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •