110000001000000 has 784 divisors, whose sum is σ = 374640600788928. Its totient is φ = 28463385600000.

The previous prime is 110000000999947. The next prime is 110000001000031. The reversal of 110000001000000 is 100000011.

110000001000000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is an unprimeable number.

It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 49172998882 + ... + 49173001118.

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

110000001000000 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 110000001000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (187320300394464).

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

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

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

110000001000000 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 1, while the sum is 3.

Adding to 110000001000000 its reverse (100000011), we get a palindrome (110000101000011).

The spelling of 110000001000000 in words is "one hundred ten trillion, one million", and thus it is an aban number.