10390631 has 2 divisors, whose sum is σ = 10390632. Its totient is φ = 10390630.

The previous prime is 10390609. The next prime is 10390651. The reversal of 10390631 is 13609301.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10390631 - 2¹⁰ = 10389607 is a prime.

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

It is a Sophie Germain prime.

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

It is a congruent number.

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

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

Almost surely, 2^10390631 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 23.

The square root of 10390631 is about 3223.4501702369. The cubic root of 10390631 is about 218.2130103815.

Adding to 10390631 its reverse (13609301), we get a palindrome (23999932).

The spelling of 10390631 in words is "ten million, three hundred ninety thousand, six hundred thirty-one".