11101111013 has 2 divisors, whose sum is σ = 11101111014. Its totient is φ = 11101111012.

The previous prime is 11101111003. The next prime is 11101111033. The reversal of 11101111013 is 31011110111.

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

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 11080299169 + 20811844 = 105263^2 + 4562^2 .

It is a cyclic number.

It is not a de Polignac number, because 11101111013 - 2¹⁰ = 11101109989 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2^11101111013 is an apocalyptic number.

It is an amenable number.

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

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

11101111013 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 11101111013 its reverse (31011110111), we get a palindrome (42112221124).

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