10925970131 has 2 divisors, whose sum is σ = 10925970132. Its totient is φ = 10925970130.

The previous prime is 10925970059. The next prime is 10925970169. The reversal of 10925970131 is 13107952901.

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

It is an a-pointer prime, because the next prime (10925970169) can be obtained adding 10925970131 to its sum of digits (38).

It is a strong prime.

It is a cyclic number.

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

It is a super-2 number, since 2×10925970131² (a number of 21 digits) contains 22 as substring.

It is a Sophie Germain prime.

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

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

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

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

Almost surely, 2^10925970131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 17010, while the sum is 38.

The spelling of 10925970131 in words is "ten billion, nine hundred twenty-five million, nine hundred seventy thousand, one hundred thirty-one".