1101011111111 has 2 divisors, whose sum is σ = 1101011111112. Its totient is φ = 1101011111110.

The previous prime is 1101011111071. The next prime is 1101011111113. The reversal of 1101011111111 is 1111111101011.

It is a strong prime.

It is a cyclic number.

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

Together with 1101011111113, it forms a pair of twin primes.

It is a Chen prime.

1101011111111 is a modest number, since divided by 1111111 gives 110101 as remainder.

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

It is a congruent number.

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

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

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

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

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

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

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

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

Adding to 1101011111111 its reverse (1111111101011), we get a palindrome (2212122212122).

It can be divided in two parts, 1101011 and 111111, that multiplied together give a palindrome (122334433221).

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