Base | Representation |
---|---|
bin | 100101100011001011110110… |
… | …110110101001110100010101 |
3 | 210122201202202011222121201122 |
4 | 211203023312312221310111 |
5 | 133121221224304202042 |
6 | 1343122505032533325 |
7 | 46533243523106114 |
oct | 4543136666516425 |
9 | 718652664877648 |
10 | 165145634053397 |
11 | 486909630a3658 |
12 | 166323b6851245 |
13 | 711c221968a8a |
14 | 2cad13c8adc7b |
15 | 1415c3c2147d2 |
hex | 9632f6da9d15 |
165145634053397 has 2 divisors, whose sum is σ = 165145634053398. Its totient is φ = 165145634053396.
The previous prime is 165145634053339. The next prime is 165145634053403. The reversal of 165145634053397 is 793350436541561.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103761950422321 + 61383683631076 = 10186361^2 + 7834774^2 .
It is an emirp because it is prime and its reverse (793350436541561) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-165145634053397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (165145634052397) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82572817026698 + 82572817026699.
It is an arithmetic number, because the mean of its divisors is an integer number (82572817026699).
Almost surely, 2165145634053397 is an apocalyptic number.
It is an amenable number.
165145634053397 is a deficient number, since it is larger than the sum of its proper divisors (1).
165145634053397 is an equidigital number, since it uses as much as digits as its factorization.
165145634053397 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 122472000, while the sum is 62.
The spelling of 165145634053397 in words is "one hundred sixty-five trillion, one hundred forty-five billion, six hundred thirty-four million, fifty-three thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •