110110101222 has 64 divisors (see below), whose sum is σ = 242963255808. Its totient is φ = 32989440000.

The previous prime is 110110101221. The next prime is 110110101239. The reversal of 110110101222 is 222101011011.

110110101222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a super-2 number, since 2×110110101222² (a number of 23 digits) contains 22 as substring.

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

It is a congruent number.

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

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

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

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

Almost surely, 2^110110101222 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 23565.

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

Adding to 110110101222 its reverse (222101011011), we get a palindrome (332211112233).

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