1101020110120 has 192 divisors, whose sum is σ = 2904664026240. Its totient is φ = 367938547200.

The previous prime is 1101020110079. The next prime is 1101020110123. The reversal of 1101020110120 is 210110201011.

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

It is a junction number, because it is equal to n+sod(n) for n = 1101020110097 and 1101020110106.

It is not an unprimeable number, because it can be changed into a prime (1101020110123) 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 47 ways as a sum of consecutive naturals, for example, 280084555 + ... + 280088485.

It is an arithmetic number, because the mean of its divisors is an integer number (15128458470).

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

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

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

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

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

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

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

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

Adding to 1101020110120 its reverse (210110201011), we get a palindrome (1311130311131).

The spelling of 1101020110120 in words is "one trillion, one hundred one billion, twenty million, one hundred ten thousand, one hundred twenty".