11512111113131 has 2 divisors, whose sum is σ = 11512111113132. Its totient is φ = 11512111113130.

The previous prime is 11512111113127. The next prime is 11512111113221. The reversal of 11512111113131 is 13131111121511.

It is a m-pointer prime, because the next prime (11512111113221) can be obtained adding 11512111113131 to its product of digits (90).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 11512111113131 - 2² = 11512111113127 is a prime.

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

It is a Sophie Germain prime.

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

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

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

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

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

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

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

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

The product of its digits is 90, while the sum is 23.

Adding to 11512111113131 its reverse (13131111121511), we get a palindrome (24643222234642).

The spelling of 11512111113131 in words is "eleven trillion, five hundred twelve billion, one hundred eleven million, one hundred thirteen thousand, one hundred thirty-one".