Base | Representation |
---|---|
bin | 11001001000000111011110… |
… | …10111111110010111000101 |
3 | 21020122021110101111211022111 |
4 | 30210003233113332113011 |
5 | 24220242131141210414 |
6 | 313303315555301021 |
7 | 14432001260015251 |
oct | 1444035727762705 |
9 | 236567411454274 |
10 | 55254475335109 |
11 | 16673322933356 |
12 | 624482bbaa771 |
13 | 24aa622ac50bb |
14 | d9048bccb261 |
15 | 65c4680158c4 |
hex | 3240ef5fe5c5 |
55254475335109 has 2 divisors, whose sum is σ = 55254475335110. Its totient is φ = 55254475335108.
The previous prime is 55254475335079. The next prime is 55254475335167. The reversal of 55254475335109 is 90153357445255.
It is a happy number.
It is an a-pointer prime, because the next prime (55254475335167) can be obtained adding 55254475335109 to its sum of digits (58).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 52366888831009 + 2887586504100 = 7236497^2 + 1699290^2 .
It is a cyclic number.
It is not a de Polignac number, because 55254475335109 - 211 = 55254475333061 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55254475135109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27627237667554 + 27627237667555.
It is an arithmetic number, because the mean of its divisors is an integer number (27627237667555).
Almost surely, 255254475335109 is an apocalyptic number.
It is an amenable number.
55254475335109 is a deficient number, since it is larger than the sum of its proper divisors (1).
55254475335109 is an equidigital number, since it uses as much as digits as its factorization.
55254475335109 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56700000, while the sum is 58.
The spelling of 55254475335109 in words is "fifty-five trillion, two hundred fifty-four billion, four hundred seventy-five million, three hundred thirty-five thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •