Search a number
-
+
101011022200000 = 26551151019001
BaseRepresentation
bin10110111101111001110110…
…000110001011110011000000
3111020122120002210221201200101
4112331321312012023303000
5101214431033140400000
6554455453433132144
730163543203065203
oct2675716606136300
9436576083851611
10101011022200000
112a204596753070
12b3b4742b5a054
1344493b5b0ca03
141ad2d6106793a
15ba27dda0ce6a
hex5bde7618bcc0

101011022200000 has 336 divisors, whose sum is σ = 273398840791776. Its totient is φ = 36720000000000.

The previous prime is 101011022199973. The next prime is 101011022200003. The reversal of 101011022200000 is 2220110101.

101011022200000 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

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

It is a self number, because there is not a number n which added to its sum of digits gives 101011022200000.

It is not an unprimeable number, because it can be changed into a prime (101011022200003) by changing a digit.

It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11222195500 + ... + 11222204500.

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

Almost surely, 2101011022200000 is an apocalyptic number.

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

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

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

101011022200000 is an frugal number, since it uses more digits than its factorization.

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

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

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

Adding to 101011022200000 its reverse (2220110101), we get a palindrome (101013242310101).

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