101011102101000 has 768 divisors, whose sum is σ = 422693191065600. Its totient is φ = 21312203328000.

The previous prime is 101011102100999. The next prime is 101011102101017. The reversal of 101011102101000 is 101201110101.

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

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

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 191 ways as a sum of consecutive naturals, for example, 138046105 + ... + 138775895.

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

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

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

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

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

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

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

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

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

Adding to 101011102101000 its reverse (101201110101), we get a palindrome (101112303211101).

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