Base | Representation |
---|---|
bin | 11001000010000011111010… |
… | …11101111011011110010001 |
3 | 21012220101101200002111112022 |
4 | 30201001331131323132101 |
5 | 24203340014400111223 |
6 | 313023545244341225 |
7 | 14410654152464354 |
oct | 1441017535733621 |
9 | 235811350074468 |
10 | 55046405863313 |
11 | 165a30600645a7 |
12 | 6210441b44815 |
13 | 2493b13a4a857 |
14 | d8439021a29b |
15 | 656d3b421ac8 |
hex | 32107d77b791 |
55046405863313 has 2 divisors, whose sum is σ = 55046405863314. Its totient is φ = 55046405863312.
The previous prime is 55046405863279. The next prime is 55046405863331. The reversal of 55046405863313 is 31336850464055.
Together with next prime (55046405863331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 54653669267344 + 392736595969 = 7392812^2 + 626687^2 .
It is a cyclic number.
It is not a de Polignac number, because 55046405863313 - 218 = 55046405601169 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (55046405863213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27523202931656 + 27523202931657.
It is an arithmetic number, because the mean of its divisors is an integer number (27523202931657).
Almost surely, 255046405863313 is an apocalyptic number.
It is an amenable number.
55046405863313 is a deficient number, since it is larger than the sum of its proper divisors (1).
55046405863313 is an equidigital number, since it uses as much as digits as its factorization.
55046405863313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552000, while the sum is 53.
The spelling of 55046405863313 in words is "fifty-five trillion, forty-six billion, four hundred five million, eight hundred sixty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •