102000111111 has 40 divisors (see below), whose sum is σ = 153604872960. Its totient is φ = 67450108752.

The previous prime is 102000111013. The next prime is 102000111151. The reversal of 102000111111 is 111111000201.

It is not a de Polignac number, because 102000111111 - 2⁷ = 102000110983 is a prime.

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

102000111111 is a modest number, since divided by 111111 gives 102000 as remainder.

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

It is a congruent number.

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

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

Almost surely, 2^102000111111 is an apocalyptic number.

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

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

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

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

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

Adding to 102000111111 its reverse (111111000201), we get a palindrome (213111111312).

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