Base | Representation |
---|---|
bin | 1001000110011001011011… |
… | …10011011110001111100000 |
3 | 2121212000221110121101122122 |
4 | 10203030231303132033200 |
5 | 10110330032400200000 |
6 | 110320534114323412 |
7 | 4133514520564520 |
oct | 443145563361740 |
9 | 77760843541578 |
10 | 20011021100000 |
11 | 64156987a7647 |
12 | 22b232a589568 |
13 | b220536b8398 |
14 | 4d2777c61680 |
15 | 24a7ec6e2085 |
hex | 12332dcde3e0 |
20011021100000 has 144 divisors (see below), whose sum is σ = 56277396828576. Its totient is φ = 6860921280000.
The previous prime is 20011021099999. The next prime is 20011021100011. The reversal of 20011021100000 is 112011002.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13593587 + ... + 14993586.
It is an arithmetic number, because the mean of its divisors is an integer number (390815255754).
Almost surely, 220011021100000 is an apocalyptic number.
20011021100000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20011021100000 is an abundant number, since it is smaller than the sum of its proper divisors (36266375728576).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20011021100000 is an frugal number, since it uses more digits than its factorization.
20011021100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28587215 (or 28587187 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 8.
Adding to 20011021100000 its reverse (112011002), we get a palindrome (20011133111002).
The spelling of 20011021100000 in words is "twenty trillion, eleven billion, twenty-one million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •