Base | Representation |
---|---|
bin | 11001001011111100000111… |
… | …00010100100000100101101 |
3 | 21021002211110100011002112022 |
4 | 30211332003202210010231 |
5 | 24224420114400022434 |
6 | 313443520120315525 |
7 | 14444331002416202 |
oct | 1445760342440455 |
9 | 237084410132468 |
10 | 55385810157869 |
11 | 16713a98a24594 |
12 | 6266183912ba5 |
13 | 24b9b233a7a89 |
14 | d9698a77dca9 |
15 | 660aa314722e |
hex | 325f838a412d |
55385810157869 has 2 divisors, whose sum is σ = 55385810157870. Its totient is φ = 55385810157868.
The previous prime is 55385810157859. The next prime is 55385810157877. The reversal of 55385810157869 is 96875101858355.
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., 52400413648969 + 2985396508900 = 7238813^2 + 1727830^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-55385810157869 is a prime.
It is a super-2 number, since 2×553858101578692 (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 (55385810157859) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27692905078934 + 27692905078935.
It is an arithmetic number, because the mean of its divisors is an integer number (27692905078935).
Almost surely, 255385810157869 is an apocalyptic number.
It is an amenable number.
55385810157869 is a deficient number, since it is larger than the sum of its proper divisors (1).
55385810157869 is an equidigital number, since it uses as much as digits as its factorization.
55385810157869 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880000, while the sum is 71.
The spelling of 55385810157869 in words is "fifty-five trillion, three hundred eighty-five billion, eight hundred ten million, one hundred fifty-seven thousand, eight hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •