156940031 has 2 divisors, whose sum is σ = 156940032. Its totient is φ = 156940030.

The previous prime is 156940013. The next prime is 156940037. The reversal of 156940031 is 130049651.

Together with previous prime (156940013) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

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

It is a super-2 number, since 2×156940031² = 49260346660561922, which contains 22 as substring.

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

It is a congruent number.

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

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

Almost surely, 2^156940031 is an apocalyptic number.

156940031 is the 5603-rd centered decagonal number.

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 29.

The square root of 156940031 is about 12527.5708339646. The cubic root of 156940031 is about 539.4003757955.

Adding to 156940031 its reverse (130049651), we get a palindrome (286989682).

The spelling of 156940031 in words is "one hundred fifty-six million, nine hundred forty thousand, thirty-one".