10111101101111 has 32 divisors (see below), whose sum is σ = 10732536288000. Its totient is φ = 9511346541312.

The previous prime is 10111101101099. The next prime is 10111101101147. The reversal of 10111101101111 is 11110110111101.

It is a cyclic number.

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

It is a Duffinian number.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (10111101101011) by changing a digit.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 128651435 + ... + 128730003.

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

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

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

10111101101111 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 79391.

The product of its (nonzero) digits is 1, while the sum is 11.

Adding to 10111101101111 its reverse (11110110111101), we get a palindrome (21221211212212).

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