Search a number
-
+
150913141 is a prime number
BaseRepresentation
bin10001111111011…
…00000001110101
3101111222011220121
420333230001311
5302113210031
622550331541
73511512001
oct1077540165
9344864817
10150913141
1178206305
1242659bb1
132535b722
1416085701
15d3b0011
hex8fec075

150913141 has 2 divisors, whose sum is σ = 150913142. Its totient is φ = 150913140.

The previous prime is 150913123. The next prime is 150913153. The reversal of 150913141 is 141319051.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 81540900 + 69372241 = 9030^2 + 8329^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 150913141 - 217 = 150782069 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2150913141 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 540, while the sum is 25.

The square root of 150913141 is about 12284.6709764649. The cubic root of 150913141 is about 532.4052786915.

The spelling of 150913141 in words is "one hundred fifty million, nine hundred thirteen thousand, one hundred forty-one".