Base | Representation |
---|---|
bin | 110100000101101100… |
… | …011100000010010101 |
3 | 12100100212100222101022 |
4 | 310011230130002111 |
5 | 1404021102010401 |
6 | 41405520210525 |
7 | 4020000043325 |
oct | 640554340225 |
9 | 170325328338 |
10 | 55930110101 |
11 | 217a10a8598 |
12 | aa0aa69a45 |
13 | 5374508108 |
14 | 29c8149285 |
15 | 16c52c471b |
hex | d05b1c095 |
55930110101 has 2 divisors, whose sum is σ = 55930110102. Its totient is φ = 55930110100.
The previous prime is 55930110079. The next prime is 55930110149. The reversal of 55930110101 is 10101103955.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49118083876 + 6812026225 = 221626^2 + 82535^2 .
It is a cyclic number.
It is not a de Polignac number, because 55930110101 - 218 = 55929847957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55930110161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27965055050 + 27965055051.
It is an arithmetic number, because the mean of its divisors is an integer number (27965055051).
Almost surely, 255930110101 is an apocalyptic number.
It is an amenable number.
55930110101 is a deficient number, since it is larger than the sum of its proper divisors (1).
55930110101 is an equidigital number, since it uses as much as digits as its factorization.
55930110101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 675, while the sum is 26.
The spelling of 55930110101 in words is "fifty-five billion, nine hundred thirty million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •