Base | Representation |
---|---|
bin | 11001000010100110110000… |
… | …00001101101000101000001 |
3 | 21012222011122211221010022112 |
4 | 30201103120001231011001 |
5 | 24204141313343411121 |
6 | 313040320545145105 |
7 | 14412215431154300 |
oct | 1441233001550501 |
9 | 235864584833275 |
10 | 55065105060161 |
11 | 165aaa86297999 |
12 | 6213ba032b195 |
13 | 2495803a98a81 |
14 | d85245852437 |
15 | 657582d8e75b |
hex | 3214d806d141 |
55065105060161 has 48 divisors (see below), whose sum is σ = 68172030351360. Its totient is φ = 44221380084000.
The previous prime is 55065105060157. The next prime is 55065105060179. The reversal of 55065105060161 is 16106050156055.
It is not a de Polignac number, because 55065105060161 - 22 = 55065105060157 is a prime.
It is not an unprimeable number, because it can be changed into a prime (55065105060131) 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 in 47 ways as a sum of consecutive naturals, for example, 71633330 + ... + 72397956.
It is an arithmetic number, because the mean of its divisors is an integer number (1420250632320).
Almost surely, 255065105060161 is an apocalyptic number.
It is an amenable number.
55065105060161 is a deficient number, since it is larger than the sum of its proper divisors (13106925291199).
55065105060161 is a wasteful number, since it uses less digits than its factorization.
55065105060161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 765514 (or 765507 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 41.
The spelling of 55065105060161 in words is "fifty-five trillion, sixty-five billion, one hundred five million, sixty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •