Search a number
-
+
10131311053 is a prime number
BaseRepresentation
bin10010110111101111…
…11000100111001101
3222011001211221000201
421123313320213031
5131222103423203
64353153053501
7506030503003
oct113367704715
928131757021
1010131311053
114329951a46
121b68b57291
13c55c74916
146c1784a73
153e4699e1d
hex25bdf89cd

10131311053 has 2 divisors, whose sum is σ = 10131311054. Its totient is φ = 10131311052.

The previous prime is 10131310993. The next prime is 10131311131. The reversal of 10131311053 is 35011313101.

10131311053 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 can be written as a sum of positive squares in only one way, i.e., 9111275209 + 1020035844 = 95453^2 + 31938^2 .

It is a cyclic number.

It is not a de Polignac number, because 10131311053 - 213 = 10131302861 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 10131311053.

It is a congruent number.

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

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

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

Almost surely, 210131311053 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 135, while the sum is 19.

Adding to 10131311053 its reverse (35011313101), we get a palindrome (45142624154).

The spelling of 10131311053 in words is "ten billion, one hundred thirty-one million, three hundred eleven thousand, fifty-three".