Base | Representation |
---|---|
bin | 11001011101110101000101… |
… | …00100001110010100000011 |
3 | 21100021121002220020211001021 |
4 | 30232322202210032110003 |
5 | 24320003021304310201 |
6 | 315034140221050311 |
7 | 14536621603433446 |
oct | 1456724244162403 |
9 | 240247086224037 |
10 | 56000511010051 |
11 | 169307575979a3 |
12 | 63453359b6997 |
13 | 2532a968c138a |
14 | db862121765d |
15 | 671a7d8d7ea1 |
hex | 32eea290e503 |
56000511010051 has 2 divisors, whose sum is σ = 56000511010052. Its totient is φ = 56000511010050.
The previous prime is 56000511010019. The next prime is 56000511010063. The reversal of 56000511010051 is 15001011500065.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 56000511010051 - 25 = 56000511010019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56000511009998 and 56000511010025.
It is not a weakly prime, because it can be changed into another prime (56000511010091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28000255505025 + 28000255505026.
It is an arithmetic number, because the mean of its divisors is an integer number (28000255505026).
Almost surely, 256000511010051 is an apocalyptic number.
56000511010051 is a deficient number, since it is larger than the sum of its proper divisors (1).
56000511010051 is an equidigital number, since it uses as much as digits as its factorization.
56000511010051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 56000511010051 in words is "fifty-six trillion, five hundred eleven million, ten thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •