10485731 has 2 divisors, whose sum is σ = 10485732. Its totient is φ = 10485730.

The previous prime is 10485721. The next prime is 10485751. The reversal of 10485731 is 13758401.

10485731 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 10485731 - 2⁶ = 10485667 is a prime.

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

It is a Chen prime.

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

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

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

Almost surely, 2^10485731 is an apocalyptic number.

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

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

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

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

The square root of 10485731 is about 3238.1678461747. The cubic root of 10485731 is about 218.8767193950.

The spelling of 10485731 in words is "ten million, four hundred eighty-five thousand, seven hundred thirty-one".