Search a number
-
+
150671431 is a prime number
BaseRepresentation
bin10001111101100…
…01000001000111
3101111111220100101
420332301001013
5302032441211
622541224531
73506454211
oct1076610107
9344456311
10150671431
1178060749
1242562147
13252a56c1
14160215b1
15d3635c1
hex8fb1047

150671431 has 2 divisors, whose sum is σ = 150671432. Its totient is φ = 150671430.

The previous prime is 150671401. The next prime is 150671447. The reversal of 150671431 is 134176051.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 150671431 - 27 = 150671303 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 150671431.

It is a congruent number.

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

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

Almost surely, 2150671431 is an apocalyptic number.

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

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

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

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

The square root of 150671431 is about 12274.8291637807. The cubic root of 150671431 is about 532.1208845372.

The spelling of 150671431 in words is "one hundred fifty million, six hundred seventy-one thousand, four hundred thirty-one".