Base | Representation |
---|---|
bin | 11001010001010011100100… |
… | …00101111000011011010111 |
3 | 21021202110101212002102102202 |
4 | 30220221302011320123113 |
5 | 24240430232430120434 |
6 | 314104333052355115 |
7 | 14463546246036032 |
oct | 1450516205703327 |
9 | 237673355072382 |
10 | 55570201020119 |
11 | 1678520a844545 |
12 | 6295a63a75a9b |
13 | 250132a903066 |
14 | da187d796019 |
15 | 665796081a7e |
hex | 328a721786d7 |
55570201020119 has 2 divisors, whose sum is σ = 55570201020120. Its totient is φ = 55570201020118.
The previous prime is 55570201020007. The next prime is 55570201020197. The reversal of 55570201020119 is 91102010207555.
55570201020119 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 55570201020119 - 232 = 55565906052823 is a prime.
It is a super-2 number, since 2×555702010201192 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55570201020319) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27785100510059 + 27785100510060.
It is an arithmetic number, because the mean of its divisors is an integer number (27785100510060).
Almost surely, 255570201020119 is an apocalyptic number.
55570201020119 is a deficient number, since it is larger than the sum of its proper divisors (1).
55570201020119 is an equidigital number, since it uses as much as digits as its factorization.
55570201020119 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31500, while the sum is 38.
The spelling of 55570201020119 in words is "fifty-five trillion, five hundred seventy billion, two hundred one million, twenty thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •