Search a number
-
+
151027147 is a prime number
BaseRepresentation
bin10010000000001…
…11110111001011
3101112011222022001
421000013313023
5302130332042
622553011431
73512465245
oct1100076713
9345158261
10151027147
1178283a27
12426b3b77
132539b59b
14160b5095
15d3d3bb7
hex9007dcb

151027147 has 2 divisors, whose sum is σ = 151027148. Its totient is φ = 151027146.

The previous prime is 151027069. The next prime is 151027159. The reversal of 151027147 is 741720151.

It is a strong prime.

It is an emirp because it is prime and its reverse (741720151) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 151027147 - 223 = 142638539 is a prime.

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

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

Almost surely, 2151027147 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 1960, while the sum is 28.

The square root of 151027147 is about 12289.3102735670. The cubic root of 151027147 is about 532.5393119015.

Adding to 151027147 its reverse (741720151), we get a palindrome (892747298).

The spelling of 151027147 in words is "one hundred fifty-one million, twenty-seven thousand, one hundred forty-seven".