1101110100111 has 12 divisors (see below), whose sum is σ = 1817705562192. Its totient is φ = 629205771456.

The previous prime is 1101110100061. The next prime is 1101110100131. The reversal of 1101110100111 is 1110010111011.

It is not a de Polignac number, because 1101110100111 - 2²¹ = 1101108002959 is a prime.

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

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

It is a congruent number.

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

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

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

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

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

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

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

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

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

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

Adding to 1101110100111 its reverse (1110010111011), we get a palindrome (2211120211122).

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