Search a number
-
+
151656731 is a prime number
BaseRepresentation
bin10010000101000…
…01100100011011
3101120100221220222
421002201210123
5302311003411
623014310255
73521026622
oct1102414433
9346327828
10151656731
1178673a46
124295838b
132555c015
14161da6b9
15d4aa4db
hex90a191b

151656731 has 2 divisors, whose sum is σ = 151656732. Its totient is φ = 151656730.

The previous prime is 151656653. The next prime is 151656761. The reversal of 151656731 is 137656151.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-151656731 is a prime.

It is a super-2 number, since 2×1516567312 = 45999528115212722, which contains 22 as substring.

It is a Sophie Germain prime.

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

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

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

Almost surely, 2151656731 is an apocalyptic number.

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

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

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

The product of its digits is 18900, while the sum is 35.

The square root of 151656731 is about 12314.8987409560. The cubic root of 151656731 is about 533.2782815138.

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