110201111112000 has 896 divisors, whose sum is σ = 385299870658560. Its totient is φ = 27714908160000.

The previous prime is 110201111111983. The next prime is 110201111112013. The reversal of 110201111112000 is 211111102011.

110201111112000 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 (12).

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 4946844862 + ... + 4946867138.

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

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

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

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

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

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

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

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

Adding to 110201111112000 its reverse (211111102011), we get a palindrome (110412222214011).

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