Search a number
-
+
151056151 is a prime number
BaseRepresentation
bin10010000000011…
…10111100010111
3101112020110002021
421000032330113
5302132244101
622553354011
73512645641
oct1100167427
9345213067
10151056151
11782a37a4
1242708907
13253ab84c
14160c1891
15d3dc5a1
hex900ef17

151056151 has 2 divisors, whose sum is σ = 151056152. Its totient is φ = 151056150.

The previous prime is 151056097. The next prime is 151056173. The reversal of 151056151 is 151650151.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 151056151 - 213 = 151047959 is a prime.

It is a congruent number.

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

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

Almost surely, 2151056151 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 750, while the sum is 25.

The square root of 151056151 is about 12290.4902668689. The cubic root of 151056151 is about 532.5734002136.

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