Search a number
-
+
165115005061 is a prime number
BaseRepresentation
bin1001100111000110011…
…1110000100010000101
3120210012011000022211211
42121301213300202011
510201123420130221
6203504111331421
714633463246256
oct2316147604205
9523164008754
10165115005061
1164030130176
1228000820b71
1312754b93a36
147dc4d90b2d
154465a5e6e1
hex26719f0885

165115005061 has 2 divisors, whose sum is σ = 165115005062. Its totient is φ = 165115005060.

The previous prime is 165115005047. The next prime is 165115005071. The reversal of 165115005061 is 160500511561.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 162917176900 + 2197828161 = 403630^2 + 46881^2 .

It is a cyclic number.

It is not a de Polignac number, because 165115005061 - 213 = 165114996869 is a prime.

It is a super-2 number, since 2×1651150050612 (a number of 23 digits) contains 22 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 2165115005061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4500, while the sum is 31.

The spelling of 165115005061 in words is "one hundred sixty-five billion, one hundred fifteen million, five thousand, sixty-one".