1100200020021 has 6 divisors (see below), whose sum is σ = 1589177806710. Its totient is φ = 733466680008.

The previous prime is 1100200020001. The next prime is 1100200020067. The reversal of 1100200020021 is 1200200020011.

It can be written as a sum of positive squares in only one way, i.e., 1088915207121 + 11284812900 = 1043511^2 + 106230^2 .

It is not a de Polignac number, because 1100200020021 - 2⁹ = 1100200019509 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 122244446669 = 1100200020021 / (1 + 1 + 0 + 0 + 2 + 0 + 0 + 0 + 2 + 0 + 0 + 2 + 1).

It is a junction number, because it is equal to n+sod(n) for n = 1100200019985 and 1100200020012.

It is a congruent number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 61122223326 + ... + 61122223343.

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

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

It is an amenable number.

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

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

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

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

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

Adding to 1100200020021 its reverse (1200200020011), we get a palindrome (2300400040032).

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