Base | Representation |
---|---|
bin | 110100011101100110… |
… | …101110001010000010 |
3 | 12101101211012201221220 |
4 | 310131212232022002 |
5 | 1410331300432032 |
6 | 41513410255510 |
7 | 4032640564152 |
oct | 643546561202 |
9 | 171354181856 |
10 | 56331264642 |
11 | 21987591974 |
12 | ab01287596 |
13 | 5409662073 |
14 | 2a25530762 |
15 | 16ea61512c |
hex | d1d9ae282 |
56331264642 has 8 divisors (see below), whose sum is σ = 112662529296. Its totient is φ = 18777088212.
The previous prime is 56331264559. The next prime is 56331264643. The reversal of 56331264642 is 24646213365.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
56331264642 is an admirable number.
It is a super-2 number, since 2×563312646422 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 56331264594 and 56331264603.
It is not an unprimeable number, because it can be changed into a prime (56331264643) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4694272048 + ... + 4694272059.
It is an arithmetic number, because the mean of its divisors is an integer number (14082816162).
Almost surely, 256331264642 is an apocalyptic number.
56331264642 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56331264642 is a wasteful number, since it uses less digits than its factorization.
56331264642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9388544112.
The product of its digits is 622080, while the sum is 42.
The spelling of 56331264642 in words is "fifty-six billion, three hundred thirty-one million, two hundred sixty-four thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •