9901110111111 has 32 divisors (see below), whose sum is σ = 15147136224000. Its totient is φ = 6388085469024.

The previous prime is 9901110111089. The next prime is 9901110111163. The reversal of 9901110111111 is 1111110111099.

It is not a de Polignac number, because 9901110111111 - 2⁶ = 9901110111047 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (9901110111811) 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 31 ways as a sum of consecutive naturals, for example, 38993121 + ... + 39246218.

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

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

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

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

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

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

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

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