910725131 has 2 divisors, whose sum is σ = 910725132. Its totient is φ = 910725130.

The previous prime is 910725113. The next prime is 910725133. The reversal of 910725131 is 131527019.

Together with previous prime (910725113) 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-910725131 is a prime.

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

Together with 910725133, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

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

Almost surely, 2^910725131 is an apocalyptic number.

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

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

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

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

The square root of 910725131 is about 30178.2227939287. Note that the first 3 decimals coincide. The cubic root of 910725131 is about 969.3094355087.

The spelling of 910725131 in words is "nine hundred ten million, seven hundred twenty-five thousand, one hundred thirty-one".