Search a number
-
+
152307527 is a prime number
BaseRepresentation
bin10010001010000…
…00011101000111
3101121121000122112
421011000131013
5302442320102
623040251235
73526410161
oct1105003507
9347530575
10152307527
1178a78999
1243010b1b
13257292c8
1416329931
15d588252
hex9140747

152307527 has 2 divisors, whose sum is σ = 152307528. Its totient is φ = 152307526.

The previous prime is 152307523. The next prime is 152307559. The reversal of 152307527 is 725703251.

It is an a-pointer prime, because the next prime (152307559) can be obtained adding 152307527 to its sum of digits (32).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 152307527 - 22 = 152307523 is a prime.

It is a Chen prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (152307523) 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, 76153763 + 76153764.

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

Almost surely, 2152307527 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 14700, while the sum is 32.

The square root of 152307527 is about 12341.2935707729. The cubic root of 152307527 is about 534.0400020065.

The spelling of 152307527 in words is "one hundred fifty-two million, three hundred seven thousand, five hundred twenty-seven".