10200011112 has 96 divisors (see below), whose sum is σ = 29605380480. Its totient is φ = 3164261760.

The previous prime is 10200011099. The next prime is 10200011113. The reversal of 10200011112 is 21111000201.

It is a happy number.

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 = 10200011094 and 10200011103.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21964 + ... + 144507.

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

Almost surely, 2^10200011112 is an apocalyptic number.

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

It is an amenable number.

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

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

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

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

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

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

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

Adding to 10200011112 its reverse (21111000201), we get a palindrome (31311011313).

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