Base | Representation |
---|---|
bin | 110011100110111111… |
… | …011101111101100111 |
3 | 12022000222002221001202 |
4 | 303212333131331213 |
5 | 1401442220130111 |
6 | 41242435513115 |
7 | 4001143525301 |
oct | 634677357547 |
9 | 168028087052 |
10 | 55415005031 |
11 | 21557364521 |
12 | a8a645879b |
13 | 52c1894909 |
14 | 2979980971 |
15 | 1694e75b3b |
hex | ce6fddf67 |
55415005031 has 2 divisors, whose sum is σ = 55415005032. Its totient is φ = 55415005030.
The previous prime is 55415005013. The next prime is 55415005073. The reversal of 55415005031 is 13050051455.
Together with previous prime (55415005013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 55415005031 - 214 = 55414988647 is a prime.
It is a super-3 number, since 3×554150050313 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 55415004985 and 55415005003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55415005091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27707502515 + 27707502516.
It is an arithmetic number, because the mean of its divisors is an integer number (27707502516).
Almost surely, 255415005031 is an apocalyptic number.
55415005031 is a deficient number, since it is larger than the sum of its proper divisors (1).
55415005031 is an equidigital number, since it uses as much as digits as its factorization.
55415005031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7500, while the sum is 29.
Adding to 55415005031 its reverse (13050051455), we get a palindrome (68465056486).
The spelling of 55415005031 in words is "fifty-five billion, four hundred fifteen million, five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •