102002111111 has 16 divisors (see below), whose sum is σ = 111502257408. Its totient is φ = 92891750400.

The previous prime is 102002111093. The next prime is 102002111143. The reversal of 102002111111 is 111111200201.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-102002111111 is a prime.

It is a super-2 number, since 2×102002111111² (a number of 23 digits) contains 22 as substring.

It is a Duffinian number.

102002111111 is a modest number, since divided by 111111 gives 102002 as remainder.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (102002111011) 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, 6759671 + ... + 6774743.

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

Almost surely, 2^102002111111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 27962.

The product of its (nonzero) digits is 4, while the sum is 11.

Adding to 102002111111 its reverse (111111200201), we get a palindrome (213113311312).

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