110002000000 has 112 divisors (see below), whose sum is σ = 273932235810. Its totient is φ = 44000000000.

The previous prime is 110001999997. The next prime is 110002000033. The reversal of 110002000000 is 200011.

It can be written as a sum of positive squares in 7 ways, for example, as 91460275776 + 18541724224 = 302424^2 + 136168^2 .

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

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 13 ways as a sum of consecutive naturals, for example, 1972500 + ... + 2027500.

Almost surely, 2^110002000000 is an apocalyptic number.

110002000000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 110002000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136966117905).

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

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

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

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

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

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

Adding to 110002000000 its reverse (200011), we get a palindrome (110002200011).

The spelling of 110002000000 in words is "one hundred ten billion, two million", and thus it is an aban number.