Search a number
-
+
201110220101100 = 22352291072153100343
BaseRepresentation
bin101101101110100010011111…
…001110101101010111101100
3222101001221122000121202101010
4231232202133032231113230
5202324442212321213400
61551420432031145220
760234506506421262
oct5556423716552754
9871057560552333
10201110220101100
1159097402350592
121a680611975210
13882a7c652904b
143793b02586432
15183b511dc8450
hexb6e89f3ad5ec

201110220101100 has 288 divisors, whose sum is σ = 607857589624320. Its totient is φ = 51271840040960.

The previous prime is 201110220101081. The next prime is 201110220101107. The reversal of 201110220101100 is 1101022011102.

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

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

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

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

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 95 ways as a sum of consecutive naturals, for example, 2004177529 + ... + 2004277871.

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

Almost surely, 2201110220101100 is an apocalyptic number.

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

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

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

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

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

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

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

Adding to 201110220101100 its reverse (1101022011102), we get a palindrome (202211242112202).

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