11111011100113 has 12 divisors (see below), whose sum is σ = 11512475152048. Its totient is φ = 10723105134000.

The previous prime is 11111011100087. The next prime is 11111011100221. The reversal of 11111011100113 is 31100111011111.

It is a happy number.

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

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

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (11111011100713) by changing a digit.

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1041531 + ... + 4827712.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 5871552 (or 5871523 counting only the distinct ones).

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

Adding to 11111011100113 its reverse (31100111011111), we get a palindrome (42211122111224).

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