Base | Representation |
---|---|
bin | 100101100001111000000001… |
… | …010011101010001110000001 |
3 | 210122102011101121110210121012 |
4 | 211201320001103222032001 |
5 | 133113232344432204121 |
6 | 1343013300334410305 |
7 | 46523606003551010 |
oct | 4541700123521601 |
9 | 718364347423535 |
10 | 165055615116161 |
11 | 48656769818760 |
12 | 16618a73660995 |
13 | 71138a6c46043 |
14 | 2ca8a3d282a77 |
15 | 141371e396c5b |
hex | 961e014ea381 |
165055615116161 has 64 divisors (see below), whose sum is σ = 218946469478400. Its totient is φ = 120618560462400.
The previous prime is 165055615116121. The next prime is 165055615116163. The reversal of 165055615116161 is 161611516550561.
It is not a de Polignac number, because 165055615116161 - 226 = 165055548007297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (165055615116163) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 37517366 + ... + 41685296.
It is an arithmetic number, because the mean of its divisors is an integer number (3421038585600).
Almost surely, 2165055615116161 is an apocalyptic number.
165055615116161 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
165055615116161 is a deficient number, since it is larger than the sum of its proper divisors (53890854362239).
165055615116161 is a wasteful number, since it uses less digits than its factorization.
165055615116161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4168410.
The product of its (nonzero) digits is 810000, while the sum is 50.
The spelling of 165055615116161 in words is "one hundred sixty-five trillion, fifty-five billion, six hundred fifteen million, one hundred sixteen thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •