Base | Representation |
---|---|
bin | 11001000010101000101110… |
… | …01101011101011101111001 |
3 | 21012222021101201121001121000 |
4 | 30201110113031131131321 |
5 | 24204201001231402203 |
6 | 313041014053435213 |
7 | 14412253622334456 |
oct | 1441242715353571 |
9 | 235867351531530 |
10 | 55066165106553 |
11 | 1660047a6a3497 |
12 | 621423733bb09 |
13 | 249594259b063 |
14 | d8530655082d |
15 | 6575e5e824a3 |
hex | 32151735d779 |
55066165106553 has 64 divisors (see below), whose sum is σ = 84773134540800. Its totient is φ = 35290157423040.
The previous prime is 55066165106471. The next prime is 55066165106569. The reversal of 55066165106553 is 35560156166055.
It is a happy number.
55066165106553 is a `hidden beast` number, since 5 + 5 + 0 + 6 + 6 + 16 + 510 + 65 + 53 = 666.
It is not a de Polignac number, because 55066165106553 - 212 = 55066165102457 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 55066165106553.
It is not an unprimeable number, because it can be changed into a prime (55066165106453) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 83842443 + ... + 84496671.
It is an arithmetic number, because the mean of its divisors is an integer number (1324580227200).
Almost surely, 255066165106553 is an apocalyptic number.
It is an amenable number.
55066165106553 is a deficient number, since it is larger than the sum of its proper divisors (29706969434247).
55066165106553 is a wasteful number, since it uses less digits than its factorization.
55066165106553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 654939 (or 654933 counting only the distinct ones).
The product of its (nonzero) digits is 12150000, while the sum is 54.
The spelling of 55066165106553 in words is "fifty-five trillion, sixty-six billion, one hundred sixty-five million, one hundred six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •