Search a number
-
+
10131110147 is a prime number
BaseRepresentation
bin10010110111101110…
…00111100100000011
3222011001110201102202
421123313013210003
5131222031011042
64353144503415
7506026005164
oct113367074403
928131421382
1010131110147
114329825004
121b68a7ab6b
13c55c04342
146c173176b
153e465a632
hex25bdc7903

10131110147 has 2 divisors, whose sum is σ = 10131110148. Its totient is φ = 10131110146.

The previous prime is 10131110141. The next prime is 10131110243. The reversal of 10131110147 is 74101113101.

10131110147 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 10131110147 - 218 = 10130848003 is a prime.

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

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

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

Almost surely, 210131110147 is an apocalyptic number.

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

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

10131110147 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 84, while the sum is 20.

Adding to 10131110147 its reverse (74101113101), we get a palindrome (84232223248).

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