Search a number
-
+
150556397 is a prime number
BaseRepresentation
bin10001111100101…
…00111011101101
3101111022001112212
420332110323231
5302020301042
622534540205
73505464635
oct1076247355
9344261485
10150556397
1177a92282
1242507665
1325265234
1415dd16c5
15d33e482
hex8f94eed

150556397 has 2 divisors, whose sum is σ = 150556398. Its totient is φ = 150556396.

The previous prime is 150556339. The next prime is 150556447. The reversal of 150556397 is 793655051.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 147525316 + 3031081 = 12146^2 + 1741^2 .

It is a cyclic number.

It is not a de Polignac number, because 150556397 - 218 = 150294253 is a prime.

It is a super-3 number, since 3×1505563973 (a number of 26 digits) contains 333 as substring.

It is a congruent number.

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

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

Almost surely, 2150556397 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 150556397 is about 12270.1425012100. The cubic root of 150556397 is about 531.9854295763.

The spelling of 150556397 in words is "one hundred fifty million, five hundred fifty-six thousand, three hundred ninety-seven".