Base | Representation |
---|---|
bin | 11001011101111101100010… |
… | …01010111011110010011111 |
3 | 21100022000211022001111211111 |
4 | 30232332301022323302133 |
5 | 24320041321024143421 |
6 | 315040210521002451 |
7 | 14540142241654534 |
oct | 1456766112736237 |
9 | 240260738044744 |
10 | 56005051006111 |
11 | 16932677276159 |
12 | 63461a2323427 |
13 | 253333b35c98c |
14 | db8932174d8b |
15 | 671c47276ee1 |
hex | 32efb12bbc9f |
56005051006111 has 8 divisors (see below), whose sum is σ = 59542695738720. Its totient is φ = 52559293149792.
The previous prime is 56005051006031. The next prime is 56005051006187. The reversal of 56005051006111 is 11160015050065.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 56005051006111 - 27 = 56005051005983 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56005051016111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22971717816 + ... + 22971720253.
It is an arithmetic number, because the mean of its divisors is an integer number (7442836967340).
Almost surely, 256005051006111 is an apocalyptic number.
56005051006111 is a deficient number, since it is larger than the sum of its proper divisors (3537644732609).
56005051006111 is a wasteful number, since it uses less digits than its factorization.
56005051006111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45943438145.
The product of its (nonzero) digits is 4500, while the sum is 31.
Adding to 56005051006111 its reverse (11160015050065), we get a palindrome (67165066056176).
The spelling of 56005051006111 in words is "fifty-six trillion, five billion, fifty-one million, six thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •