Base | Representation |
---|---|
bin | 100101100101100101011100… |
… | …010001000110100101110111 |
3 | 210200022112102001121020200002 |
4 | 211211211130101012211313 |
5 | 133131421443311234223 |
6 | 1343330340550341515 |
7 | 46551202251434102 |
oct | 4545453421064567 |
9 | 720275361536602 |
10 | 165310544243063 |
11 | 487448986519aa |
12 | 1665a35a95a89b |
13 | 713194327a76b |
14 | 2cb7104587739 |
15 | 141a18ecb7e28 |
hex | 96595c446977 |
165310544243063 has 2 divisors, whose sum is σ = 165310544243064. Its totient is φ = 165310544243062.
The previous prime is 165310544242981. The next prime is 165310544243237. The reversal of 165310544243063 is 360342445013561.
It is a happy number.
165310544243063 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-165310544243063 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 165310544242999 and 165310544243017.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (165310544246063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82655272121531 + 82655272121532.
It is an arithmetic number, because the mean of its divisors is an integer number (82655272121532).
Almost surely, 2165310544243063 is an apocalyptic number.
165310544243063 is a deficient number, since it is larger than the sum of its proper divisors (1).
165310544243063 is an equidigital number, since it uses as much as digits as its factorization.
165310544243063 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3110400, while the sum is 47.
The spelling of 165310544243063 in words is "one hundred sixty-five trillion, three hundred ten billion, five hundred forty-four million, two hundred forty-three thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.991 sec. • engine limits •