Base | Representation |
---|---|
bin | 100101100011010101111111… |
… | …011110100111100110100011 |
3 | 210122202210211120121012221001 |
4 | 211203111333132213212203 |
5 | 133121411021114303201 |
6 | 1343131504530212431 |
7 | 46534110301410064 |
oct | 4543257736474643 |
9 | 718683746535831 |
10 | 165156516166051 |
11 | 48695537832993 |
12 | 16634533124117 |
13 | 7120267328ca7 |
14 | 2cad891c5456b |
15 | 1416177769301 |
hex | 96357f7a79a3 |
165156516166051 has 2 divisors, whose sum is σ = 165156516166052. Its totient is φ = 165156516166050.
The previous prime is 165156516165947. The next prime is 165156516166121. The reversal of 165156516166051 is 150661615651561.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 165156516166051 - 233 = 165147926231459 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 165156516165983 and 165156516166001.
It is not a weakly prime, because it can be changed into another prime (165156516766051) 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, 82578258083025 + 82578258083026.
It is an arithmetic number, because the mean of its divisors is an integer number (82578258083026).
Almost surely, 2165156516166051 is an apocalyptic number.
165156516166051 is a deficient number, since it is larger than the sum of its proper divisors (1).
165156516166051 is an equidigital number, since it uses as much as digits as its factorization.
165156516166051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860000, while the sum is 55.
The spelling of 165156516166051 in words is "one hundred sixty-five trillion, one hundred fifty-six billion, five hundred sixteen million, one hundred sixty-six thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •