10112131147 has 2 divisors, whose sum is σ = 10112131148. Its totient is φ = 10112131146.

The previous prime is 10112131121. The next prime is 10112131157. The reversal of 10112131147 is 74113121101.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10112131147 - 2⁷ = 10112131019 is a prime.

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

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

Almost surely, 2^10112131147 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 168, while the sum is 22.

Adding to 10112131147 its reverse (74113121101), we get a palindrome (84225252248).

The spelling of 10112131147 in words is "ten billion, one hundred twelve million, one hundred thirty-one thousand, one hundred forty-seven".