Base | Representation |
---|---|
bin | 11001000101011010010001… |
… | …11011000001110110011011 |
3 | 21020022101102222012220200020 |
4 | 30202231020323001312123 |
5 | 24212231212013304110 |
6 | 313152500555041523 |
7 | 14422200051160212 |
oct | 1442551073016633 |
9 | 236271388186606 |
10 | 55161488416155 |
11 | 16637946176900 |
12 | 622a7baa402a3 |
13 | 24a192421b674 |
14 | d89b8a430079 |
15 | 659d2482ad70 |
hex | 322b48ec1d9b |
55161488416155 has 48 divisors (see below), whose sum is σ = 97971786837792. Its totient is φ = 26480162368000.
The previous prime is 55161488416127. The next prime is 55161488416163.
55161488416155 is nontrivially palindromic in base 10.
55161488416155 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 55161488416155 - 28 = 55161488415899 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 150272154 + ... + 150638783.
It is an arithmetic number, because the mean of its divisors is an integer number (2041078892454).
Almost surely, 255161488416155 is an apocalyptic number.
55161488416155 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
55161488416155 is a deficient number, since it is larger than the sum of its proper divisors (42810298421637).
55161488416155 is a wasteful number, since it uses less digits than its factorization.
55161488416155 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300911068 (or 300911057 counting only the distinct ones).
The product of its digits is 23040000, while the sum is 60.
The spelling of 55161488416155 in words is "fifty-five trillion, one hundred sixty-one billion, four hundred eighty-eight million, four hundred sixteen thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •