Search a number
-
+
151140131 is a prime number
BaseRepresentation
bin10010000001000…
…11011100100011
3101112101201021122
421000203130203
5302142441011
622555242455
73513445532
oct1100433443
9345351248
10151140131
11783508aa
124274942b
132540ab3c
1416104319
15d4073db
hex9023723

151140131 has 2 divisors, whose sum is σ = 151140132. Its totient is φ = 151140130.

The previous prime is 151140103. The next prime is 151140133. The reversal of 151140131 is 131041151.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 151140131 - 214 = 151123747 is a prime.

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

It is a Sophie Germain prime.

Together with 151140133, it forms a pair of twin primes.

It is a Chen prime.

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

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

Almost surely, 2151140131 is an apocalyptic number.

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

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

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

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

The square root of 151140131 is about 12293.9062547264. The cubic root of 151140131 is about 532.6720770478.

Adding to 151140131 its reverse (131041151), we get a palindrome (282181282).

The spelling of 151140131 in words is "one hundred fifty-one million, one hundred forty thousand, one hundred thirty-one".