111100110111113 has 2 divisors, whose sum is σ = 111100110111114. Its totient is φ = 111100110111112.

The previous prime is 111100110111061. The next prime is 111100110111131. The reversal of 111100110111113 is 311111011001111.

Together with next prime (111100110111131) 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., 83868286309369 + 27231823801744 = 9157963^2 + 5218412^2 .

It is a cyclic number.

It is not a de Polignac number, because 111100110111113 - 2³⁴ = 111082930241929 is a prime.

It is a super-3 number, since 3×111100110111113³ (a number of 43 digits) contains 333 as substring.

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

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

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

It is an amenable number.

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

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

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

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

Adding to 111100110111113 its reverse (311111011001111), we get a palindrome (422211121112224).

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