101111102101111 has 4 divisors (see below), whose sum is σ = 101111184682272. Its totient is φ = 101111019519952.

The previous prime is 101111102100997. The next prime is 101111102101127. The reversal of 101111102101111 is 111101201111101.

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-101111102101111 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

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

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

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

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

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

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

The sum of its prime factors is 82581160.

The product of its (nonzero) digits is 2, while the sum is 13.

Adding to 101111102101111 its reverse (111101201111101), we get a palindrome (212212303212212).

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