1101011112000 has 336 divisors, whose sum is σ = 3992471366832. Its totient is φ = 289579622400.

The previous prime is 1101011111947. The next prime is 1101011112011. The reversal of 1101011112000 is 2111101011.

It can be written as a sum of positive squares in 8 ways, for example, as 273813585984 + 827197526016 = 523272^2 + 909504^2 .

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

It is an unprimeable number.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5151262 + ... + 5360738.

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

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

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

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

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

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

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

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

Adding to 1101011112000 its reverse (2111101011), we get a palindrome (1103122213011).

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