Base | Representation |
---|---|
bin | 1001001001010011101011… |
… | …01010101101101000011100 |
3 | 2122012121000221021011112101 |
4 | 10210221311222231220130 |
5 | 10113444322304323400 |
6 | 110434512041214444 |
7 | 4143654413033362 |
oct | 444516552555034 |
9 | 78177027234471 |
10 | 20111011011100 |
11 | 6454039471809 |
12 | 2309794a91424 |
13 | b2b5ca0a4959 |
14 | 4d7541817632 |
15 | 24d200ad756a |
hex | 124a75aada1c |
20111011011100 has 72 divisors (see below), whose sum is σ = 45300070484928. Its totient is φ = 7744177132800.
The previous prime is 20111011011071. The next prime is 20111011011101. The reversal of 20111011011100 is 111011011102.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111011011101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34786567 + ... + 35359966.
It is an arithmetic number, because the mean of its divisors is an integer number (629167645624).
Almost surely, 220111011011100 is an apocalyptic number.
20111011011100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20111011011100 is an abundant number, since it is smaller than the sum of its proper divisors (25189059473828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20111011011100 is a wasteful number, since it uses less digits than its factorization.
20111011011100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70146655 (or 70146648 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 20111011011100 its reverse (111011011102), we get a palindrome (20222022022202).
The spelling of 20111011011100 in words is "twenty trillion, one hundred eleven billion, eleven million, eleven thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •