Base | Representation |
---|---|
bin | 11001010001000000110001… |
… | …01000010011110010100001 |
3 | 21021201111100121100200002221 |
4 | 30220200120220103302201 |
5 | 24240244101200123212 |
6 | 314055543502311041 |
7 | 14463041216122615 |
oct | 1450403050236241 |
9 | 237644317320087 |
10 | 55560110161057 |
11 | 16780a018117a7 |
12 | 6293b08588481 |
13 | 25003b0152938 |
14 | da11a3541345 |
15 | 6653a5227807 |
hex | 328818a13ca1 |
55560110161057 has 2 divisors, whose sum is σ = 55560110161058. Its totient is φ = 55560110161056.
The previous prime is 55560110161033. The next prime is 55560110161097. The reversal of 55560110161057 is 75016101106555.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51030006573841 + 4530103587216 = 7143529^2 + 2128404^2 .
It is a cyclic number.
It is not a de Polignac number, because 55560110161057 - 243 = 46764017138849 is a prime.
It is a super-2 number, since 2×555601101610572 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (55560110161097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27780055080528 + 27780055080529.
It is an arithmetic number, because the mean of its divisors is an integer number (27780055080529).
Almost surely, 255560110161057 is an apocalyptic number.
It is an amenable number.
55560110161057 is a deficient number, since it is larger than the sum of its proper divisors (1).
55560110161057 is an equidigital number, since it uses as much as digits as its factorization.
55560110161057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 157500, while the sum is 43.
The spelling of 55560110161057 in words is "fifty-five trillion, five hundred sixty billion, one hundred ten million, one hundred sixty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •