110200020021 has 64 divisors (see below), whose sum is σ = 202885795840. Its totient is φ = 57563006400.

The previous prime is 110200020017. The next prime is 110200020053. The reversal of 110200020021 is 120020002011.

It is not a de Polignac number, because 110200020021 - 2² = 110200020017 is a prime.

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 = 110200019985 and 110200020012.

It is a congruent number.

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

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 35346 + ... + 470796.

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

Almost surely, 2^110200020021 is an apocalyptic number.

It is an amenable number.

110200020021 is a deficient number, since it is larger than the sum of its proper divisors (92685775819).

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

110200020021 is an evil number, because the sum of its binary digits is even.

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

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

Adding to 110200020021 its reverse (120020002011), we get a palindrome (230220022032).

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