Base | Representation |
---|---|
bin | 1100110100010011110… |
… | …1000110011101010110 |
3 | 210001101010112011112210 |
4 | 3031010331012131112 |
5 | 12101432222400042 |
6 | 245054130254250 |
7 | 21623523550305 |
oct | 3150475063526 |
9 | 701333464483 |
10 | 220200200022 |
11 | 854282aa490 |
12 | 36814727386 |
13 | 179c332115a |
14 | a92cbdc43c |
15 | 5adba88a9c |
hex | 3344f46756 |
220200200022 has 16 divisors (see below), whose sum is σ = 480436800192. Its totient is φ = 66727333320.
The previous prime is 220200200021. The next prime is 220200200041. The reversal of 220200200022 is 220002002022.
It is a junction number, because it is equal to n+sod(n) for n = 220200199980 and 220200200007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220200200021) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1668183268 + ... + 1668183399.
It is an arithmetic number, because the mean of its divisors is an integer number (30027300012).
Almost surely, 2220200200022 is an apocalyptic number.
220200200022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
220200200022 is an abundant number, since it is smaller than the sum of its proper divisors (260236600170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220200200022 is a wasteful number, since it uses less digits than its factorization.
220200200022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3336366683.
The product of its (nonzero) digits is 64, while the sum is 12.
Adding to 220200200022 its reverse (220002002022), we get a palindrome (440202202044).
It can be divided in two parts, 2202002000 and 22, that added together give a palindrome (2202002022).
The spelling of 220200200022 in words is "two hundred twenty billion, two hundred million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •