Base | Representation |
---|---|
bin | 110100111001110101… |
… | …001101110001011000 |
3 | 12102121211022011021212 |
4 | 310321311031301120 |
5 | 1412314013414300 |
6 | 42032404322252 |
7 | 4050451025123 |
oct | 647165156130 |
9 | 172554264255 |
10 | 56804826200 |
11 | 220aa930761 |
12 | b0139a3388 |
13 | 54837bb2c5 |
14 | 2a6c3a33ba |
15 | 1726ea9935 |
hex | d39d4dc58 |
56804826200 has 24 divisors (see below), whose sum is σ = 132071221380. Its totient is φ = 22721930400.
The previous prime is 56804826163. The next prime is 56804826203. The reversal of 56804826200 is 262840865.
It is a super-2 number, since 2×568048262002 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (41) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56804826203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 142011866 + ... + 142012265.
Almost surely, 256804826200 is an apocalyptic number.
56804826200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
56804826200 is an abundant number, since it is smaller than the sum of its proper divisors (75266395180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56804826200 is a wasteful number, since it uses less digits than its factorization.
56804826200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 284024147 (or 284024138 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 41.
The spelling of 56804826200 in words is "fifty-six billion, eight hundred four million, eight hundred twenty-six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •