Base | Representation |
---|---|
bin | 100101100001000101001010… |
… | …111101010110000101010101 |
3 | 210122012221110111222202202112 |
4 | 211201011022331112011111 |
5 | 133111334040122040103 |
6 | 1342532230450320405 |
7 | 46516633666510625 |
oct | 4541051275260525 |
9 | 718187414882675 |
10 | 165001016205653 |
11 | 486355a1098121 |
12 | 1660a376589105 |
13 | 710b6b547abc4 |
14 | 2ca613dc5a885 |
15 | 14120c5dc6cd8 |
hex | 96114af56155 |
165001016205653 has 2 divisors, whose sum is σ = 165001016205654. Its totient is φ = 165001016205652.
The previous prime is 165001016205607. The next prime is 165001016205667. The reversal of 165001016205653 is 356502610100561.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 164990479799044 + 10536406609 = 12844862^2 + 102647^2 .
It is a cyclic number.
It is not a de Polignac number, because 165001016205653 - 26 = 165001016205589 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 165001016205653.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (165001016205953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82500508102826 + 82500508102827.
It is an arithmetic number, because the mean of its divisors is an integer number (82500508102827).
Almost surely, 2165001016205653 is an apocalyptic number.
It is an amenable number.
165001016205653 is a deficient number, since it is larger than the sum of its proper divisors (1).
165001016205653 is an equidigital number, since it uses as much as digits as its factorization.
165001016205653 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162000, while the sum is 41.
The spelling of 165001016205653 in words is "one hundred sixty-five trillion, one billion, sixteen million, two hundred five thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •