Base | Representation |
---|---|
bin | 110100101100011011… |
… | …111101001110111011 |
3 | 12102001011102221100012 |
4 | 310230123331032323 |
5 | 1411334001213201 |
6 | 41554215532135 |
7 | 4042051631555 |
oct | 645433751673 |
9 | 172034387305 |
10 | 56580101051 |
11 | 21aa4aa03a1 |
12 | ab7068a04b |
13 | 5449087c46 |
14 | 2a4a5c64d5 |
15 | 17123b95bb |
hex | d2c6fd3bb |
56580101051 has 2 divisors, whose sum is σ = 56580101052. Its totient is φ = 56580101050.
The previous prime is 56580100949. The next prime is 56580101087. The reversal of 56580101051 is 15010108565.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56580101051 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 56580100999 and 56580101017.
It is not a weakly prime, because it can be changed into another prime (56580181051) 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, 28290050525 + 28290050526.
It is an arithmetic number, because the mean of its divisors is an integer number (28290050526).
Almost surely, 256580101051 is an apocalyptic number.
56580101051 is a deficient number, since it is larger than the sum of its proper divisors (1).
56580101051 is an equidigital number, since it uses as much as digits as its factorization.
56580101051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6000, while the sum is 32.
The spelling of 56580101051 in words is "fifty-six billion, five hundred eighty million, one hundred one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.032 sec. • engine limits •