Base | Representation |
---|---|
bin | 100000000000111011011… |
… | …110110110110010010100 |
3 | 21210022122021000121102102 |
4 | 200000323132312302110 |
5 | 242021120411400040 |
6 | 4402401545301232 |
7 | 314642401436510 |
oct | 40007336666224 |
9 | 7708567017372 |
10 | 2200021200020 |
11 | 779029681966 |
12 | 2b6466794818 |
13 | 12c5cc096c27 |
14 | 786a56cd140 |
15 | 3c36323d515 |
hex | 2003b7b6c94 |
2200021200020 has 48 divisors (see below), whose sum is σ = 5280724178688. Its totient is φ = 754196797440.
The previous prime is 2200021200011. The next prime is 2200021200067. The reversal of 2200021200020 is 200021200022.
It is a junction number, because it is equal to n+sod(n) for n = 2200021199974 and 2200021200010.
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 15 ways as a sum of consecutive naturals, for example, 104225 + ... + 2100215.
It is an arithmetic number, because the mean of its divisors is an integer number (110015087056).
Almost surely, 22200021200020 is an apocalyptic number.
2200021200020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2200021200020 is an abundant number, since it is smaller than the sum of its proper divisors (3080702978668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2200021200020 is a wasteful number, since it uses less digits than its factorization.
2200021200020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2003880 (or 2003878 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 11.
Adding to 2200021200020 its reverse (200021200022), we get a palindrome (2400042400042).
The spelling of 2200021200020 in words is "two trillion, two hundred billion, twenty-one million, two hundred thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •