11101110101111 has 4 divisors (see below), whose sum is σ = 11110509856824. Its totient is φ = 11091710345400.

The previous prime is 11101110101089. The next prime is 11101110101203. The reversal of 11101110101111 is 11110101110111.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

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

It is a Duffinian number.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4699876085 + ... + 4699878446.

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

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

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

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

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

The sum of its prime factors is 9399755712.

The product of its (nonzero) digits is 1, while the sum is 11.

Adding to 11101110101111 its reverse (11110101110111), we get a palindrome (22211211211222).

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