Search a number
-
+
152011151 is a prime number
BaseRepresentation
bin10010000111110…
…00000110001111
3101121000222002122
421003320012033
5302403324101
623030043155
73524034125
oct1103700617
9347028078
10152011151
1178896256
1242aa94bb
1325654436
141628d915
15d52a51b
hex90f818f

152011151 has 2 divisors, whose sum is σ = 152011152. Its totient is φ = 152011150.

The previous prime is 152011147. The next prime is 152011159. The reversal of 152011151 is 151110251.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 152011151 - 22 = 152011147 is a prime.

It is a congruent number.

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

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

Almost surely, 2152011151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 50, while the sum is 17.

The square root of 152011151 is about 12329.2802304109. The cubic root of 152011151 is about 533.6933800160.

The spelling of 152011151 in words is "one hundred fifty-two million, eleven thousand, one hundred fifty-one".