1102000110111 has 32 divisors (see below), whose sum is σ = 1665365053440. Its totient is φ = 729058407480.

The previous prime is 1102000110097. The next prime is 1102000110131. The reversal of 1102000110111 is 1110110002011.

It is not a de Polignac number, because 1102000110111 - 2⁶ = 1102000110047 is a prime.

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

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 = 1102000110093 and 1102000110102.

It is a congruent number.

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

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

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

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

1102000110111 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 1102000110111 its reverse (1110110002011), we get a palindrome (2212110112122).

The spelling of 1102000110111 in words is "one trillion, one hundred two billion, one hundred ten thousand, one hundred eleven".