Search a number
-
+
101000210022000 = 24325337439134537
BaseRepresentation
bin10110111101101111110001…
…101000111111111001110000
3111020121112012021221011210100
4112331233301220333321300
5101214241412231201000
6554450504514432400
730163011234066312
oct2675576150777160
9436545167834710
10101000210022000
112a1aaa4853a773
12b3b2625b92700
134448381a97653
141ad26170c97b2
15ba23a96bea00
hex5bdbf1a3fe70

101000210022000 has 480 divisors, whose sum is σ = 362387123489664. Its totient is φ = 26198733312000.

The previous prime is 101000210021981. The next prime is 101000210022031. The reversal of 101000210022000 is 220012000101.

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

It is a congruent number.

It is an unprimeable number.

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

Almost surely, 2101000210022000 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 101000210022000 its reverse (220012000101), we get a palindrome (101220222022101).

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