100550022210 has 96 divisors (see below), whose sum is σ = 286390391040. Its totient is φ = 24273715200.

The previous prime is 100550022197. The next prime is 100550022211. The reversal of 100550022210 is 12220055001.

100550022210 is a `hidden beast` number, since 100 + 550 + 0 + 2 + 2 + 2 + 10 = 666.

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

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

It is a Curzon number.

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

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

Almost surely, 2^100550022210 is an apocalyptic number.

100550022210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

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

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

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

The product of its (nonzero) digits is 200, while the sum is 18.

Adding to 100550022210 its reverse (12220055001), we get a palindrome (112770077211).

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