11110110100013 has 2 divisors, whose sum is σ = 11110110100014. Its totient is φ = 11110110100012.

The previous prime is 11110110099971. The next prime is 11110110100021. The reversal of 11110110100013 is 31000101101111.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8886200026729 + 2223910073284 = 2980973^2 + 1491278^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

It is a congruent number.

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

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

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

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

It is an amenable number.

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

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

11110110100013 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 11.

Adding to 11110110100013 its reverse (31000101101111), we get a palindrome (42110211201124).

The spelling of 11110110100013 in words is "eleven trillion, one hundred ten billion, one hundred ten million, one hundred thousand, thirteen".