Search a number
BaseRepresentation
bin10010101110101010…
…010111100000011100
31220220111220120110100
4102232222113200130
5312141203223400
613123303341100
71311230655030
oct225652274034
956814816410
1020110211100
11858a765281
123a92a51790
131b864850c5
14d8abb41c0
157ca78b100
hex4aea9781c

20110211100 has 216 divisors, whose sum is σ = 72909083520. Its totient is φ = 4541120640.

The previous prime is 20110211089. The next prime is 20110211123. The reversal of 20110211100 is 111201102.

Adding to 20110211100 its reverse (111201102), we get a palindrome (20221412202).

It is a happy number.

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 pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 503671 + ... + 542129.

Almost surely, 220110211100 is an apocalyptic number.

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

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

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

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

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

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

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

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