10110111001013 has 2 divisors, whose sum is σ = 10110111001014. Its totient is φ = 10110111001012.

The previous prime is 10110111000971. The next prime is 10110111001037. The reversal of 10110111001013 is 31010011101101.

10110111001013 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., 9853434004324 + 256676996689 = 3139018^2 + 506633^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-10110111001013 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2^{10110111001013} is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 11.

Adding to 10110111001013 its reverse (31010011101101), we get a palindrome (41120122102114).

The spelling of 10110111001013 in words is "ten trillion, one hundred ten billion, one hundred eleven million, one thousand, thirteen".