Base | Representation |
---|---|
bin | 11001000010010100000010… |
… | …00000000011100011100101 |
3 | 21012221012201110010000012112 |
4 | 30201022001000003203211 |
5 | 24204010223044404212 |
6 | 313031535415130405 |
7 | 14411411405540525 |
oct | 1441120100034345 |
9 | 235835643100175 |
10 | 55055055075557 |
11 | 165a6799342799 |
12 | 6212056673a05 |
13 | 249489192a214 |
14 | d84970bdb685 |
15 | 65719590b422 |
hex | 3212810038e5 |
55055055075557 has 2 divisors, whose sum is σ = 55055055075558. Its totient is φ = 55055055075556.
The previous prime is 55055055075479. The next prime is 55055055075689. The reversal of 55055055075557 is 75557055055055.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 48640009629121 + 6415045446436 = 6974239^2 + 2532794^2 .
It is a cyclic number.
It is not a de Polignac number, because 55055055075557 - 232 = 55050760108261 is a prime.
It is a super-2 number, since 2×550550550755572 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55055055075496 and 55055055075505.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55055055375557) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27527527537778 + 27527527537779.
It is an arithmetic number, because the mean of its divisors is an integer number (27527527537779).
Almost surely, 255055055075557 is an apocalyptic number.
It is an amenable number.
55055055075557 is a deficient number, since it is larger than the sum of its proper divisors (1).
55055055075557 is an equidigital number, since it uses as much as digits as its factorization.
55055055075557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 95703125, while the sum is 59.
The spelling of 55055055075557 in words is "fifty-five trillion, fifty-five billion, fifty-five million, seventy-five thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •