10110322002 has 64 divisors (see below), whose sum is σ = 22698797184. Its totient is φ = 2975178240.

The previous prime is 10110321983. The next prime is 10110322003. The reversal of 10110322002 is 20022301101.

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

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

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

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, 1356478 + ... + 1363910.

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

Almost surely, 2^10110322002 is an apocalyptic number.

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

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

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

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

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

The sum of its prime factors is 8043.

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

Adding to 10110322002 its reverse (20022301101), we get a palindrome (30132623103).

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