1311111512111 has 2 divisors, whose sum is σ = 1311111512112. Its totient is φ = 1311111512110.

The previous prime is 1311111512099. The next prime is 1311111512141. The reversal of 1311111512111 is 1112151111131.

It is a m-pointer prime, because the next prime (1311111512141) can be obtained adding 1311111512111 to its product of digits (30).

It is a weak prime.

It is a cyclic number.

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

It is a congruent number.

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

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

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

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

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

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

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

The product of its digits is 30, while the sum is 20.

Adding to 1311111512111 its reverse (1112151111131), we get a palindrome (2423262623242).

The spelling of 1311111512111 in words is "one trillion, three hundred eleven billion, one hundred eleven million, five hundred twelve thousand, one hundred eleven".