111110011110113 has 2 divisors, whose sum is σ = 111110011110114. Its totient is φ = 111110011110112.

The previous prime is 111110011110097. The next prime is 111110011110127. The reversal of 111110011110113 is 311011110011111.

It is an a-pointer prime, because the next prime (111110011110127) can be obtained adding 111110011110113 to its sum of digits (14).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 110903793401569 + 206217708544 = 10531087^2 + 454112^2 .

It is a cyclic number.

It is not a de Polignac number, because 111110011110113 - 2⁴ = 111110011110097 is a prime.

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

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

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

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

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

It is an amenable number.

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

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

111110011110113 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 14.

Adding to 111110011110113 its reverse (311011110011111), we get a palindrome (422121121121224).

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