11110010111113 has 2 divisors, whose sum is σ = 11110010111114. Its totient is φ = 11110010111112.

The previous prime is 11110010111093. The next prime is 11110010111131. The reversal of 11110010111113 is 31111101001111.

It is a happy number.

Together with next prime (11110010111131) 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., 7791171465289 + 3318838645824 = 2791267^2 + 1821768^2 .

It is a cyclic number.

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

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

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

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

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

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

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

It is an amenable number.

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

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

11110010111113 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 13.

Adding to 11110010111113 its reverse (31111101001111), we get a palindrome (42221111112224).

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