Search a number
-
+
150370529 is a prime number
BaseRepresentation
bin10001111011001…
…11100011100001
3101110221121120212
420331213203201
5301443324104
622530543505
73504062021
oct1075474341
9343847525
10150370529
1177975671
1242437b95
13251cb75a
1415d83a81
15d30436e
hex8f678e1

150370529 has 2 divisors, whose sum is σ = 150370530. Its totient is φ = 150370528.

The previous prime is 150370483. The next prime is 150370537. The reversal of 150370529 is 925073051.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 108638929 + 41731600 = 10423^2 + 6460^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-150370529 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 150370495 and 150370504.

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

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

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

Almost surely, 2150370529 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9450, while the sum is 32.

The square root of 150370529 is about 12262.5661669978. The cubic root of 150370529 is about 531.7664202044.

The spelling of 150370529 in words is "one hundred fifty million, three hundred seventy thousand, five hundred twenty-nine".