1001111111111 has 2 divisors, whose sum is σ = 1001111111112. Its totient is φ = 1001111111110.

The previous prime is 1001111111107. The next prime is 1001111111123. The reversal of 1001111111111 is 1111111111001.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 1001111111111 - 2² = 1001111111107 is a prime.

It is a Sophie Germain prime.

1001111111111 is a modest number, since divided by 1111111 gives 100111 as remainder.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1001111111131) 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 as a sum of consecutive naturals, namely, 500555555555 + 500555555556.

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

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

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

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

1001111111111 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 1001111111111 its reverse (1111111111001), we get a palindrome (2112222222112).

It can be divided in two parts, 1001 and 111111111, that multiplied together give a palindrome (111222222111).

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