Base | Representation |
---|---|
bin | 1010000110000111011110… |
… | …0010110010011110100100 |
3 | 1110022011120002201000120110 |
4 | 2201201313202302132210 |
5 | 2423331202440214340 |
6 | 35335210104533020 |
7 | 2223651221403630 |
oct | 241416742623644 |
9 | 43264502630513 |
10 | 11100201101220 |
11 | 359a62915a370 |
12 | 12b3362a81170 |
13 | 62698a7b50aa |
14 | 2a53771c3dc0 |
15 | 143b1d3b9680 |
hex | a18778b27a4 |
11100201101220 has 192 divisors, whose sum is σ = 38752116480000. Its totient is φ = 2306396989440.
The previous prime is 11100201101219. The next prime is 11100201101233. The reversal of 11100201101220 is 2210110200111.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 11100201101196 and 11100201101205.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 88867971 + ... + 88992789.
It is an arithmetic number, because the mean of its divisors is an integer number (201833940000).
Almost surely, 211100201101220 is an apocalyptic number.
11100201101220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11100201101220 is an abundant number, since it is smaller than the sum of its proper divisors (27651915378780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11100201101220 is a wasteful number, since it uses less digits than its factorization.
11100201101220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144098 (or 144096 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11100201101220 its reverse (2210110200111), we get a palindrome (13310311301331).
The spelling of 11100201101220 in words is "eleven trillion, one hundred billion, two hundred one million, one hundred one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •