Base | Representation |
---|---|
bin | 100101100001110111111101… |
… | …101110100010110111001011 |
3 | 210122102011020102110101020122 |
4 | 211201313331232202313023 |
5 | 133113232234043230201 |
6 | 1343013250351213455 |
7 | 46523604344210513 |
oct | 4541677556426713 |
9 | 718364212411218 |
10 | 165055555055051 |
11 | 48656738925981 |
12 | 16618a5751728b |
13 | 711389767731b |
14 | 2ca8a352ca843 |
15 | 1413718e80e1b |
hex | 961dfdba2dcb |
165055555055051 has 2 divisors, whose sum is σ = 165055555055052. Its totient is φ = 165055555055050.
The previous prime is 165055555055023. The next prime is 165055555055057. The reversal of 165055555055051 is 150550555550561.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-165055555055051 is a prime.
It is a super-2 number, since 2×1650555550550512 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 165055555054984 and 165055555055002.
It is not a weakly prime, because it can be changed into another prime (165055555055057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82527777527525 + 82527777527526.
It is an arithmetic number, because the mean of its divisors is an integer number (82527777527526).
Almost surely, 2165055555055051 is an apocalyptic number.
165055555055051 is a deficient number, since it is larger than the sum of its proper divisors (1).
165055555055051 is an equidigital number, since it uses as much as digits as its factorization.
165055555055051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11718750, while the sum is 53.
The spelling of 165055555055051 in words is "one hundred sixty-five trillion, fifty-five billion, five hundred fifty-five million, fifty-five thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •