110100011022 has 64 divisors (see below), whose sum is σ = 250272000000. Its totient is φ = 35861706720.

The previous prime is 110100011009. The next prime is 110100011033. The reversal of 110100011022 is 220110001011.

It is a happy number.

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

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

It is a congruent number.

It is an unprimeable number.

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, 1567104 + ... + 1635852.

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

Almost surely, 2^110100011022 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 110100011022 its reverse (220110001011), we get a palindrome (330210012033).

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