10311101513 has 2 divisors, whose sum is σ = 10311101514. Its totient is φ = 10311101512.

The previous prime is 10311101483. The next prime is 10311101527. The reversal of 10311101513 is 31510111301.

It is a happy number.

10311101513 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 can be written as a sum of positive squares in only one way, i.e., 7844290624 + 2466810889 = 88568^2 + 49667^2 .

It is a cyclic number.

It is not a de Polignac number, because 10311101513 - 2²⁰ = 10310052937 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 2^10311101513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 45, while the sum is 17.

Adding to 10311101513 its reverse (31510111301), we get a palindrome (41821212814).

The spelling of 10311101513 in words is "ten billion, three hundred eleven million, one hundred one thousand, five hundred thirteen".