Base | Representation |
---|---|
bin | 110100001101101100… |
… | …001101111111111011 |
3 | 12100201012211000121201 |
4 | 310031230031333323 |
5 | 1404304423122311 |
6 | 41431111515031 |
7 | 4023216302116 |
oct | 641554157773 |
9 | 170635730551 |
10 | 56064270331 |
11 | 2185a901113 |
12 | aa47988a77 |
13 | 539624c374 |
14 | 29dbcad57d |
15 | 16d1e759c1 |
hex | d0db0dffb |
56064270331 has 2 divisors, whose sum is σ = 56064270332. Its totient is φ = 56064270330.
The previous prime is 56064270259. The next prime is 56064270341. The reversal of 56064270331 is 13307246065.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 56064270331 - 213 = 56064262139 is a prime.
It is a super-2 number, since 2×560642703312 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (56064270341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28032135165 + 28032135166.
It is an arithmetic number, because the mean of its divisors is an integer number (28032135166).
Almost surely, 256064270331 is an apocalyptic number.
56064270331 is a deficient number, since it is larger than the sum of its proper divisors (1).
56064270331 is an equidigital number, since it uses as much as digits as its factorization.
56064270331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 37.
The spelling of 56064270331 in words is "fifty-six billion, sixty-four million, two hundred seventy thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •