101101111021000 has 128 divisors (see below), whose sum is σ = 240525754560000. Its totient is φ = 39769454400000.

The previous prime is 101101111020989. The next prime is 101101111021013. The reversal of 101101111021000 is 120111101101.

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

It is an unprimeable number.

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

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17279676 + ... + 22378324.

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

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

101101111021000 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 101101111021000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (120262877280000).

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

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

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

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

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

The product of its (nonzero) digits is 2, while the sum is 10.

Adding to 101101111021000 its reverse (120111101101), we get a palindrome (101221222122101).

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