200011120101 has 32 divisors (see below), whose sum is σ = 319182864000. Its totient is φ = 123054142464.

The previous prime is 200011120097. The next prime is 200011120129. The reversal of 200011120101 is 101021110002.

It is a happy number.

It is not a de Polignac number, because 200011120101 - 2² = 200011120097 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a congruent number.

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

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

Almost surely, 2^200011120101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 200011120101 its reverse (101021110002), we get a palindrome (301032230103).

The spelling of 200011120101 in words is "two hundred billion, eleven million, one hundred twenty thousand, one hundred one".