109901111111 has 16 divisors (see below), whose sum is σ = 122568906240. Its totient is φ = 97683818880.

The previous prime is 109901111107. The next prime is 109901111141. The reversal of 109901111111 is 111111109901.

It is a cyclic number.

It is not a de Polignac number, because 109901111111 - 2² = 109901111107 is a prime.

109901111111 is a modest number, since divided by 111111 gives 109901 as remainder.

It is a congruent number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 396320 + ... + 613898.

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

Almost surely, 2^109901111111 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 218614.

The product of its (nonzero) digits is 81, while the sum is 26.

It can be divided in two parts, 1099011 and 11111, that multiplied together give a palindrome (12211111221).

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