Search a number
-
+
150753151 is a prime number
BaseRepresentation
bin10001111110001…
…00111101111111
3101111200001110001
420333010331333
5302043100101
622543055131
73510244363
oct1077047577
9344601401
10150753151
117810708a
12425a14a7
1325303963
14160432a3
15d37c901
hex8fc4f7f

150753151 has 2 divisors, whose sum is σ = 150753152. Its totient is φ = 150753150.

The previous prime is 150753139. The next prime is 150753157. The reversal of 150753151 is 151357051.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 150753151 - 29 = 150752639 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 (150753157) by changing a digit.

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

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

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

Almost surely, 2150753151 is an apocalyptic number.

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

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

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

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

The square root of 150753151 is about 12278.1574757779. The cubic root of 150753151 is about 532.2170696801.

The spelling of 150753151 in words is "one hundred fifty million, seven hundred fifty-three thousand, one hundred fifty-one".