Base | Representation |
---|---|
bin | 110100010110100000… |
… | …001001011101000000 |
3 | 12101002111222121002000 |
4 | 310112200021131000 |
5 | 1410110244212203 |
6 | 41453512224000 |
7 | 4026662655114 |
oct | 642640113500 |
9 | 171074877060 |
10 | 56212100928 |
11 | 219262a1465 |
12 | aa8939b000 |
13 | 53baa6b9a9 |
14 | 2a13791744 |
15 | 16dee274a3 |
hex | d16809740 |
56212100928 has 56 divisors (see below), whose sum is σ = 165253172160. Its totient is φ = 18737366400.
The previous prime is 56212100921. The next prime is 56212100953. The reversal of 56212100928 is 82900121265.
56212100928 is a `hidden beast` number, since 5 + 621 + 2 + 1 + 0 + 0 + 9 + 28 = 666.
It is a super-2 number, since 2×562121009282 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 56212100892 and 56212100901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56212100921) 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 7 ways as a sum of consecutive naturals, for example, 16263348 + ... + 16266803.
Almost surely, 256212100928 is an apocalyptic number.
It is an amenable number.
56212100928 is an abundant number, since it is smaller than the sum of its proper divisors (109041071232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56212100928 is a wasteful number, since it uses less digits than its factorization.
56212100928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32530172 (or 32530156 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 36.
The spelling of 56212100928 in words is "fifty-six billion, two hundred twelve million, one hundred thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •