11111001011111 has 2 divisors, whose sum is σ = 11111001011112. Its totient is φ = 11111001011110.

The previous prime is 11111001011059. The next prime is 11111001011153. The reversal of 11111001011111 is 11111010011111.

It is a strong prime.

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

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

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

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

11111001011111 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 11111001011111 its reverse (11111010011111), we get a palindrome (22222011022222).

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

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