1101111022000 has 160 divisors (see below), whose sum is σ = 2923040038464. Its totient is φ = 397852416000.

The previous prime is 1101111021947. The next prime is 1101111022001. The reversal of 1101111022000 is 2201111011.

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

It is not an unprimeable number, because it can be changed into a prime (1101111022001) by changing a digit.

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

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

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

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

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

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

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

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

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

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

Adding to 1101111022000 its reverse (2201111011), we get a palindrome (1103312133011).

It can be divided in two parts, 11011 and 11022000, that added together give a palindrome (11033011).

The spelling of 1101111022000 in words is "one trillion, one hundred one billion, one hundred eleven million, twenty-two thousand".