Search a number
-
+
165765151 is a prime number
BaseRepresentation
bin10011110000101…
…10000000011111
3102112220202001001
421320112000133
5314413441101
624240531131
74051660216
oct1170260037
9375822031
10165765151
118562a8a2
1247620aa7
132845b8b6
141803007d
15e845901
hex9e1601f

165765151 has 2 divisors, whose sum is σ = 165765152. Its totient is φ = 165765150.

The previous prime is 165765137. The next prime is 165765157. The reversal of 165765151 is 151567561.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 165765151 - 29 = 165764639 is a prime.

It is equal to p9279244 and since 165765151 and 9279244 have the same sum of digits, it is a Honaker prime.

It is a self number, because there is not a number n which added to its sum of digits gives 165765151.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2165765151 is an apocalyptic number.

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

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

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

The product of its digits is 31500, while the sum is 37.

The square root of 165765151 is about 12874.9815922199. The cubic root of 165765151 is about 549.3271673204.

The spelling of 165765151 in words is "one hundred sixty-five million, seven hundred sixty-five thousand, one hundred fifty-one".