110211101022 has 64 divisors (see below), whose sum is σ = 247126464000. Its totient is φ = 32472708480.

The previous prime is 110211101009. The next prime is 110211101057. The reversal of 110211101022 is 220101112011.

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

It is a congruent number.

It is an unprimeable number.

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

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

Almost surely, 2^110211101022 is an apocalyptic number.

It is a practical number, because each smaller number is the sum of distinct divisors of 110211101022, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123563232000).

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

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

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

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

The sum of its prime factors is 30561.

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

Adding to 110211101022 its reverse (220101112011), we get a palindrome (330312213033).

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