11011110111011 has 2 divisors, whose sum is σ = 11011110111012. Its totient is φ = 11011110111010.

The previous prime is 11011110110989. The next prime is 11011110111019. The reversal of 11011110111011 is 11011101111011.

It is a strong prime.

It is a cyclic number.

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

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

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

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

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

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

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

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

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

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

Adding to 11011110111011 its reverse (11011101111011), we get a palindrome (22022211222022).

Subtracting from 11011110111011 its reverse (11011101111011), we obtain a square (9000000 = 3000²).

It can be divided in two parts, 11011 and 110111011, that multiplied together give a palindrome (1212432342121).

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