Base | Representation |
---|---|
bin | 110100101101010001… |
… | …001011010110000000 |
3 | 12102002010200202002210 |
4 | 310231101023112000 |
5 | 1411401034134410 |
6 | 41555434542120 |
7 | 4042311336360 |
oct | 645521132600 |
9 | 172063622083 |
10 | 56594052480 |
11 | 2200195a2a9 |
12 | ab75297940 |
13 | 544bc31224 |
14 | 2a4c3b89a0 |
15 | 1713723220 |
hex | d2d44b580 |
56594052480 has 256 divisors, whose sum is σ = 208294248960. Its totient is φ = 12802129920.
The previous prime is 56594052467. The next prime is 56594052481. The reversal of 56594052480 is 8425049565.
It is a super-2 number, since 2×565940524802 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56594052481) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1281975 + ... + 1325385.
It is an arithmetic number, because the mean of its divisors is an integer number (813649410).
Almost surely, 256594052480 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 56594052480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (104147124480).
56594052480 is an abundant number, since it is smaller than the sum of its proper divisors (151700196480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56594052480 is a wasteful number, since it uses less digits than its factorization.
56594052480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43537 (or 43525 counting only the distinct ones).
The product of its (nonzero) digits is 1728000, while the sum is 48.
The spelling of 56594052480 in words is "fifty-six billion, five hundred ninety-four million, fifty-two thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.035 sec. • engine limits •