110100000120021 has 64 divisors (see below), whose sum is σ = 168665764838400. Its totient is φ = 71826522888960.

The previous prime is 110100000119953. The next prime is 110100000120023. The reversal of 110100000120021 is 120021000001011.

It is a happy number.

It is not a de Polignac number, because 110100000120021 - 2³⁸ = 109825122213077 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 = 110100000119985 and 110100000120012.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 2^{110100000120021} is an apocalyptic number.

It is an amenable number.

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

110100000120021 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 110100000120021 its reverse (120021000001011), we get a palindrome (230121000121032).

The spelling of 110100000120021 in words is "one hundred ten trillion, one hundred billion, one hundred twenty thousand, twenty-one".