Search a number
-
+
150914957 is a prime number
BaseRepresentation
bin10001111111011…
…00011110001101
3101111222021101212
420333230132031
5302113234312
622550344205
73511520204
oct1077543615
9344867355
10150914957
1178207706
124265b065
132535c4bb
141608623b
15d3b0822
hex8fec78d

150914957 has 2 divisors, whose sum is σ = 150914958. Its totient is φ = 150914956.

The previous prime is 150914921. The next prime is 150914963. The reversal of 150914957 is 759419051.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 142539721 + 8375236 = 11939^2 + 2894^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 150914957 - 212 = 150910861 is a prime.

It is a Chen prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (150914857) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 75457478 + 75457479.

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

Almost surely, 2150914957 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 56700, while the sum is 41.

The square root of 150914957 is about 12284.7448894961. The cubic root of 150914957 is about 532.4074142336.

The spelling of 150914957 in words is "one hundred fifty million, nine hundred fourteen thousand, nine hundred fifty-seven".