139150237 has 2 divisors, whose sum is σ = 139150238. Its totient is φ = 139150236.

The previous prime is 139150213. The next prime is 139150307. The reversal of 139150237 is 732051931.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 79103236 + 60047001 = 8894^2 + 7749^2 .

It is a cyclic number.

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

It is a Chen prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2^139150237 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5670, while the sum is 31.

The square root of 139150237 is about 11796.1958698557. The cubic root of 139150237 is about 518.1967085334.

The spelling of 139150237 in words is "one hundred thirty-nine million, one hundred fifty thousand, two hundred thirty-seven".