Base | Representation |
---|---|
bin | 11001001101110011101101… |
… | …11101110011001000010001 |
3 | 21021022222012111021011122201 |
4 | 30212321312331303020101 |
5 | 24231443122031444212 |
6 | 313533220023403201 |
7 | 14452063164511204 |
oct | 1446716675631021 |
9 | 237288174234581 |
10 | 55450023703057 |
11 | 1673924a88a4a5 |
12 | 62767048b3501 |
13 | 24c2bb7a74069 |
14 | d99b1ca9393b |
15 | 6625b0752b57 |
hex | 326e76f73211 |
55450023703057 has 2 divisors, whose sum is σ = 55450023703058. Its totient is φ = 55450023703056.
The previous prime is 55450023702959. The next prime is 55450023703079. The reversal of 55450023703057 is 75030732005455.
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., 39350541546001 + 16099482157056 = 6273001^2 + 4012416^2 .
It is a cyclic number.
It is not a de Polignac number, because 55450023703057 - 215 = 55450023670289 is a prime.
It is a super-2 number, since 2×554500237030572 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 55450023702998 and 55450023703016.
It is not a weakly prime, because it can be changed into another prime (55450023703957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27725011851528 + 27725011851529.
It is an arithmetic number, because the mean of its divisors is an integer number (27725011851529).
Almost surely, 255450023703057 is an apocalyptic number.
It is an amenable number.
55450023703057 is a deficient number, since it is larger than the sum of its proper divisors (1).
55450023703057 is an equidigital number, since it uses as much as digits as its factorization.
55450023703057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2205000, while the sum is 46.
The spelling of 55450023703057 in words is "fifty-five trillion, four hundred fifty billion, twenty-three million, seven hundred three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •