109110101111 has 32 divisors (see below), whose sum is σ = 125588275200. Its totient is φ = 93870194400.

The previous prime is 109110101099. The next prime is 109110101123. The reversal of 109110101111 is 111101011901.

It is an interprime number because it is at equal distance from previous prime (109110101099) and next prime (109110101123).

It is a cyclic number.

It is not a de Polignac number, because 109110101111 - 2⁶ = 109110101047 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 109110101111.

It is a congruent number.

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

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27227870 + ... + 27231876.

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

Almost surely, 2^109110101111 is an apocalyptic number.

109110101111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

The sum of its prime factors is 5795.

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

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