101101101111 has 12 divisors (see below), whose sum is σ = 146099828680. Its totient is φ = 67370778000.

The previous prime is 101101101097. The next prime is 101101101113. The reversal of 101101101111 is 111101101101.

It is not a de Polignac number, because 101101101111 - 2⁷ = 101101100983 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

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

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2474956 + ... + 2515473.

Almost surely, 2^101101101111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 4992686 (or 4992683 counting only the distinct ones).

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

Adding to 101101101111 its reverse (111101101101), we get a palindrome (212202202212).

It can be divided in two parts, 101101101 and 111, that multiplied together give a palindrome (11222222211).

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