Search a number
-
+
156505117 is a prime number
BaseRepresentation
bin10010101010000…
…01010000011101
3101220111021122211
421111001100131
5310031130432
623310240421
73610162066
oct1125012035
9356437584
10156505117
118038567a
12444b6111
1326568aa2
1416add56d
15db16d47
hex954141d

156505117 has 2 divisors, whose sum is σ = 156505118. Its totient is φ = 156505116.

The previous prime is 156505091. The next prime is 156505121. The reversal of 156505117 is 711505651.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 100120036 + 56385081 = 10006^2 + 7509^2 .

It is a cyclic number.

It is not a de Polignac number, because 156505117 - 27 = 156504989 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2156505117 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 156505117 is about 12510.2005179773. The cubic root of 156505117 is about 538.9016506671.

The spelling of 156505117 in words is "one hundred fifty-six million, five hundred five thousand, one hundred seventeen".