10110111110993 has 2 divisors, whose sum is σ = 10110111110994. Its totient is φ = 10110111110992.

The previous prime is 10110111110989. The next prime is 10110111111013. The reversal of 10110111110993 is 39901111101101.

10110111110993 is digitally balanced in base 2, 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., 8483075655184 + 1627035455809 = 2912572^2 + 1275553^2 .

It is a cyclic number.

It is not a de Polignac number, because 10110111110993 - 2² = 10110111110989 is a prime.

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

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

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

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

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

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 243, while the sum is 29.

The spelling of 10110111110993 in words is "ten trillion, one hundred ten billion, one hundred eleven million, one hundred ten thousand, nine hundred ninety-three".