Base | Representation |
---|---|
bin | 1001010110010011100… |
… | …1010111100000100111 |
3 | 120100112221120002020210 |
4 | 2111210321113200213 |
5 | 10112410234100210 |
6 | 201440455430503 |
7 | 14413660102500 |
oct | 2254471274047 |
9 | 510487502223 |
10 | 160606550055 |
11 | 621272351a6 |
12 | 27162985433 |
13 | 121b6b19993 |
14 | 7ab82c3ba7 |
15 | 429ed50e20 |
hex | 2564e57827 |
160606550055 has 24 divisors (see below), whose sum is σ = 298924845552. Its totient is φ = 73420136832.
The previous prime is 160606550047. The next prime is 160606550077. The reversal of 160606550055 is 550055606061.
160606550055 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 160606550055 - 23 = 160606550047 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 160606549995 and 160606550022.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 109255422 + ... + 109256891.
It is an arithmetic number, because the mean of its divisors is an integer number (12455201898).
Almost surely, 2160606550055 is an apocalyptic number.
160606550055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
160606550055 is a deficient number, since it is larger than the sum of its proper divisors (138318295497).
160606550055 is a wasteful number, since it uses less digits than its factorization.
160606550055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218512335 (or 218512328 counting only the distinct ones).
The product of its (nonzero) digits is 135000, while the sum is 39.
The spelling of 160606550055 in words is "one hundred sixty billion, six hundred six million, five hundred fifty thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •