Base | Representation |
---|---|
bin | 1101010101001… |
… | …1100111010101 |
3 | 10220012212201111 |
4 | 3111103213111 |
5 | 103303321023 |
6 | 5314255021 |
7 | 1246200235 |
oct | 325234725 |
9 | 126185644 |
10 | 55917013 |
11 | 29622309 |
12 | 16887471 |
13 | b77a6b9 |
14 | 75d7cc5 |
15 | 4d9800d |
hex | 35539d5 |
55917013 has 2 divisors, whose sum is σ = 55917014. Its totient is φ = 55917012.
The previous prime is 55917007. The next prime is 55917031. The reversal of 55917013 is 31071955.
Together with next prime (55917031) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 43007364 + 12909649 = 6558^2 + 3593^2 .
It is a cyclic number.
It is not a de Polignac number, because 55917013 - 217 = 55785941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55917613) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27958506 + 27958507.
It is an arithmetic number, because the mean of its divisors is an integer number (27958507).
Almost surely, 255917013 is an apocalyptic number.
It is an amenable number.
55917013 is a deficient number, since it is larger than the sum of its proper divisors (1).
55917013 is an equidigital number, since it uses as much as digits as its factorization.
55917013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4725, while the sum is 31.
The square root of 55917013 is about 7477.7679156283. The cubic root of 55917013 is about 382.3971569096.
Adding to 55917013 its reverse (31071955), we get a palindrome (86988968).
The spelling of 55917013 in words is "fifty-five million, nine hundred seventeen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •