Search a number
-
+
165324556513553 is a prime number
BaseRepresentation
bin100101100101110010011111…
…011101101011000100010001
3210200100212120121011100012012
4211211302133131223010101
5133132134142431413203
61343341015222112305
746552206425656463
oct4545623735530421
9720325517140165
10165324556513553
114874a829171138
121666100b57b695
137133067294788
142cb7a73536133
15141a710021bd8
hex965c9f76b111

165324556513553 has 2 divisors, whose sum is σ = 165324556513554. Its totient is φ = 165324556513552.

The previous prime is 165324556513511. The next prime is 165324556513559. The reversal of 165324556513553 is 355315655423561.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 108269602151824 + 57054954361729 = 10405268^2 + 7553473^2 .

It is a cyclic number.

It is not a de Polignac number, because 165324556513553 - 28 = 165324556513297 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 165324556513492 and 165324556513501.

It is not a weakly prime, because it can be changed into another prime (165324556513559) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 82662278256776 + 82662278256777.

It is an arithmetic number, because the mean of its divisors is an integer number (82662278256777).

Almost surely, 2165324556513553 is an apocalyptic number.

It is an amenable number.

165324556513553 is a deficient number, since it is larger than the sum of its proper divisors (1).

165324556513553 is an equidigital number, since it uses as much as digits as its factorization.

165324556513553 is an odious number, because the sum of its binary digits is odd.

The product of its digits is 121500000, while the sum is 59.

The spelling of 165324556513553 in words is "one hundred sixty-five trillion, three hundred twenty-four billion, five hundred fifty-six million, five hundred thirteen thousand, five hundred fifty-three".