101102002200 has 384 divisors, whose sum is σ = 369679464000. Its totient is φ = 25308979200.

The previous prime is 101102002189. The next prime is 101102002207. The reversal of 101102002200 is 2200201101.

It is a super-2 number, since 2×101102002200² (a number of 23 digits) contains 22 as substring.

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 (101102002207) by changing a digit.

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

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 42318606 + ... + 42320994.

Almost surely, 2^101102002200 is an apocalyptic number.

101102002200 is a gapful number since it is divisible by the number (10) 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 101102002200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (184839732000).

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

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

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

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

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

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

Adding to 101102002200 its reverse (2200201101), we get a palindrome (103302203301).

It can be divided in two parts, 10110200 and 2200, that added together give a square (10112400 = 3180²).

The spelling of 101102002200 in words is "one hundred one billion, one hundred two million, two thousand, two hundred".