1100110111002 has 64 divisors (see below), whose sum is σ = 2940979430400. Its totient is φ = 297774163440.

The previous prime is 1100110110989. The next prime is 1100110111013. The reversal of 1100110111002 is 2001110110011.

It is a super-2 number, since 2×1100110111002² (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 an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 76580824 + ... + 76595187.

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

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

1100110111002 is an abundant number, since it is smaller than the sum of its proper divisors (1840869319398).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

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

Adding to 1100110111002 its reverse (2001110110011), we get a palindrome (3101220221013).

Subtracting 1100110111002 from its reverse (2001110110011), we obtain a palindrome (900999999009).

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