20001103122 has 384 divisors, whose sum is σ = 58503997440. Its totient is φ = 4480842240.

The previous prime is 20001103097. The next prime is 20001103193. The reversal of 20001103122 is 22130110002.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 273987678 + ... + 273987750.

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

Almost surely, 2^20001103122 is an apocalyptic number.

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

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

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

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

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

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

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

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

Adding to 20001103122 its reverse (22130110002), we get a palindrome (42131213124).

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