11060500011131 has 2 divisors, whose sum is σ = 11060500011132. Its totient is φ = 11060500011130.

The previous prime is 11060500011061. The next prime is 11060500011133. The reversal of 11060500011131 is 13111000506011.

11060500011131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 11060500011131 - 2³⁴ = 11043320141947 is a prime.

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

It is a Sophie Germain prime.

Together with 11060500011133, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

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

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

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

The product of its (nonzero) digits is 90, while the sum is 20.

Adding to 11060500011131 its reverse (13111000506011), we get a palindrome (24171500517142).

The spelling of 11060500011131 in words is "eleven trillion, sixty billion, five hundred million, eleven thousand, one hundred thirty-one".