11131112111123 has 2 divisors, whose sum is σ = 11131112111124. Its totient is φ = 11131112111122.

The previous prime is 11131112111099. The next prime is 11131112111159. The reversal of 11131112111123 is 32111121113111.

It is a m-pointer prime, because the next prime (11131112111159) can be obtained adding 11131112111123 to its product of digits (36).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11131112111123 - 2¹⁰ = 11131112110099 is a prime.

It is a super-2 number, since 2×11131112111123² (a number of 27 digits) contains 22 as substring.

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

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

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

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

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

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

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

11131112111123 is an evil number, because the sum of its binary digits is even.

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

Adding to 11131112111123 its reverse (32111121113111), we get a palindrome (43242233224234).

The spelling of 11131112111123 in words is "eleven trillion, one hundred thirty-one billion, one hundred twelve million, one hundred eleven thousand, one hundred twenty-three".