Base | Representation |
---|---|
bin | 11001011010100011100001… |
… | …00001111101001110100001 |
3 | 21022212211200222110111212102 |
4 | 30231101300201331032201 |
5 | 24311132112103432111 |
6 | 314510332135140145 |
7 | 14525526541165454 |
oct | 1455216041751641 |
9 | 238784628414772 |
10 | 55888002405281 |
11 | 16897a723a6a02 |
12 | 6327576b14655 |
13 | 25252a6771567 |
14 | db2dcabc349b |
15 | 66db9646513b |
hex | 32d47087d3a1 |
55888002405281 has 2 divisors, whose sum is σ = 55888002405282. Its totient is φ = 55888002405280.
The previous prime is 55888002405217. The next prime is 55888002405283. The reversal of 55888002405281 is 18250420088855.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 48839062365025 + 7048940040256 = 6988495^2 + 2654984^2 .
It is a cyclic number.
It is not a de Polignac number, because 55888002405281 - 26 = 55888002405217 is a prime.
It is a super-2 number, since 2×558880024052812 (a number of 28 digits) contains 22 as substring.
Together with 55888002405283, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (55888002405283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27944001202640 + 27944001202641.
It is an arithmetic number, because the mean of its divisors is an integer number (27944001202641).
Almost surely, 255888002405281 is an apocalyptic number.
It is an amenable number.
55888002405281 is a deficient number, since it is larger than the sum of its proper divisors (1).
55888002405281 is an equidigital number, since it uses as much as digits as its factorization.
55888002405281 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8192000, while the sum is 56.
The spelling of 55888002405281 in words is "fifty-five trillion, eight hundred eighty-eight billion, two million, four hundred five thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •