Base | Representation |
---|---|
bin | 1010000001100000011011… |
… | …0011010111101001001100 |
3 | 1110000121010110020221010202 |
4 | 2200120012303113221030 |
5 | 2421032002023223040 |
6 | 35234551054553032 |
7 | 2215145442060332 |
oct | 240300663275114 |
9 | 43017113227122 |
10 | 11021000211020 |
11 | 3569a86336308 |
12 | 129bb3a808778 |
13 | 61c3780b0c17 |
14 | 2a15c2621b52 |
15 | 141a35149015 |
hex | a0606cd7a4c |
11021000211020 has 96 divisors (see below), whose sum is σ = 24552397840320. Its totient is φ = 4141152174080.
The previous prime is 11021000211017. The next prime is 11021000211031. The reversal of 11021000211020 is 2011200012011.
It is a junction number, because it is equal to n+sod(n) for n = 11021000210992 and 11021000211010.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 438704060 + ... + 438729180.
It is an arithmetic number, because the mean of its divisors is an integer number (255754144170).
Almost surely, 211021000211020 is an apocalyptic number.
11021000211020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11021000211020 is an abundant number, since it is smaller than the sum of its proper divisors (13531397629300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11021000211020 is a wasteful number, since it uses less digits than its factorization.
11021000211020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27563 (or 27561 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 11021000211020 its reverse (2011200012011), we get a palindrome (13032200223031).
The spelling of 11021000211020 in words is "eleven trillion, twenty-one billion, two hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •