102001101111 has 48 divisors (see below), whose sum is σ = 181370629440. Its totient is φ = 53792294400.

The previous prime is 102001101067. The next prime is 102001101113. The reversal of 102001101111 is 111101100201.

It is not a de Polignac number, because 102001101111 - 2¹⁴ = 102001084727 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 = 102001101093 and 102001101102.

It is a congruent number.

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

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6026761 + ... + 6043661.

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

Almost surely, 2^102001101111 is an apocalyptic number.

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

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

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

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

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

Adding to 102001101111 its reverse (111101100201), we get a palindrome (213102201312).

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