1111101110051 has 2 divisors, whose sum is σ = 1111101110052. Its totient is φ = 1111101110050.

The previous prime is 1111101109927. The next prime is 1111101110089. The reversal of 1111101110051 is 1500111011111.

It is a strong prime.

It is a cyclic number.

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

It is a Sophie Germain prime.

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

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

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

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

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

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

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

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

The product of its (nonzero) digits is 5, while the sum is 14.

Adding to 1111101110051 its reverse (1500111011111), we get a palindrome (2611212121162).

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