1121111315111 has 2 divisors, whose sum is σ = 1121111315112. Its totient is φ = 1121111315110.

The previous prime is 1121111315041. The next prime is 1121111315141. The reversal of 1121111315111 is 1115131111211.

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

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1121111315111 - 2³⁰ = 1120037573287 is a prime.

It is a super-3 number, since 3×1121111315111³ (a number of 37 digits) contains 333 as substring.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

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

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

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

1121111315111 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 1121111315111 its reverse (1115131111211), we get a palindrome (2236242426322).

The spelling of 1121111315111 in words is "one trillion, one hundred twenty-one billion, one hundred eleven million, three hundred fifteen thousand, one hundred eleven".