110111110102013 has 2 divisors, whose sum is σ = 110111110102014. Its totient is φ = 110111110102012.

The previous prime is 110111110101977. The next prime is 110111110102031. The reversal of 110111110102013 is 310201011111011.

Together with next prime (110111110102031) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 87063026193049 + 23048083908964 = 9330757^2 + 4800842^2 .

It is a cyclic number.

It is not a de Polignac number, because 110111110102013 - 2³⁰ = 110110036360189 is a prime.

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6, while the sum is 14.

Adding to 110111110102013 its reverse (310201011111011), we get a palindrome (420312121213024).

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