10111010111111 has 8 divisors (see below), whose sum is σ = 12444320136864. Its totient is φ = 7999920087840.

The previous prime is 10111010111087. The next prime is 10111010111113. The reversal of 10111010111111 is 11111101011101.

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

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 10111010111111 - 2⁴² = 5712963600007 is a prime.

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

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55555000520 + ... + 55555000701.

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

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

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

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

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

The sum of its prime factors is 111110001241.

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

Adding to 10111010111111 its reverse (11111101011101), we get a palindrome (21222111122212).

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