10112010210 has 96 divisors (see below), whose sum is σ = 27879126912. Its totient is φ = 2534146560.

The previous prime is 10112010173. The next prime is 10112010217. The reversal of 10112010210 is 1201021101.

It is a happy number.

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

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 = 10112010192 and 10112010201.

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

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

Almost surely, 2^10112010210 is an apocalyptic number.

10112010210 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 10112010210, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13939563456).

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

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

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

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

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

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

Adding to 10112010210 its reverse (1201021101), we get a palindrome (11313031311).

The spelling of 10112010210 in words is "ten billion, one hundred twelve million, ten thousand, two hundred ten".