10110101111111 has 4 divisors (see below), whose sum is σ = 10110167420424. Its totient is φ = 10110034801800.

The previous prime is 10110101111083. The next prime is 10110101111141. The reversal of 10110101111111 is 11111110101101.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

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

It is a Duffinian number.

10110101111111 is a modest number, since divided by 1111111 gives 1011010 as remainder.

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

It is a congruent number.

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32925425 + ... + 33231066.

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

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

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

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

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

The sum of its prime factors is 66309312.

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

Adding to 10110101111111 its reverse (11111110101101), we get a palindrome (21221211212212).

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