100002011022 has 64 divisors (see below), whose sum is σ = 234431366400. Its totient is φ = 31510931040.

The previous prime is 100002010993. The next prime is 100002011023. The reversal of 100002011022 is 220110200001.

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 = 100002010995 and 100002011013.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (100002011023) 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, 367273 + ... + 578699.

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

Almost surely, 2^100002011022 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 100002011022 its reverse (220110200001), we get a palindrome (320112211023).

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