11111010011131 has 2 divisors, whose sum is σ = 11111010011132. Its totient is φ = 11111010011130.

The previous prime is 11111010011107. The next prime is 11111010011137. The reversal of 11111010011131 is 13111001011111.

It is a happy number.

It is a strong prime.

It is a cyclic number.

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

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 3, while the sum is 13.

Adding to 11111010011131 its reverse (13111001011111), we get a palindrome (24222011022242).

The spelling of 11111010011131 in words is "eleven trillion, one hundred eleven billion, ten million, eleven thousand, one hundred thirty-one".