Base | Representation |
---|---|
bin | 11101011001011101100… |
… | …100010010010000111000 |
3 | 21011010111112000211202102 |
4 | 131121131210102100320 |
5 | 231044334313002300 |
6 | 4144022531522532 |
7 | 265645356155036 |
oct | 35313544222070 |
9 | 7133445024672 |
10 | 2020204422200 |
11 | 709844803278 |
12 | 287642459448 |
13 | 1186733b4093 |
14 | 6dac7d89556 |
15 | 3783bb780d5 |
hex | 1d65d912438 |
2020204422200 has 24 divisors (see below), whose sum is σ = 4696975282080. Its totient is φ = 808081768800.
The previous prime is 2020204422163. The next prime is 2020204422289. The reversal of 2020204422200 is 22244020202.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
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 5 ways as a sum of consecutive naturals, for example, 5050510856 + ... + 5050511255.
It is an arithmetic number, because the mean of its divisors is an integer number (195707303420).
Almost surely, 22020204422200 is an apocalyptic number.
2020204422200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2020204422200 is an abundant number, since it is smaller than the sum of its proper divisors (2676770859880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2020204422200 is a wasteful number, since it uses less digits than its factorization.
2020204422200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10101022127 (or 10101022118 counting only the distinct ones).
The product of its (nonzero) digits is 1024, while the sum is 20.
Adding to 2020204422200 its reverse (22244020202), we get a palindrome (2042448442402).
The spelling of 2020204422200 in words is "two trillion, twenty billion, two hundred four million, four hundred twenty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •