Base | Representation |
---|---|
bin | 101101111110011001100111… |
… | …110011111001101100110100 |
3 | 222111221011002102201022211020 |
4 | 231332121213303321230310 |
5 | 203000322013234120040 |
6 | 1554013254532541140 |
7 | 60406324515026004 |
oct | 5576314763715464 |
9 | 874834072638736 |
10 | 202200212020020 |
11 | 594776a0378095 |
12 | 1a817909a817b0 |
13 | 88a9523a47846 |
14 | 37d07847c6004 |
15 | 1859a58e21cd0 |
hex | b7e667cf9b34 |
202200212020020 has 24 divisors (see below), whose sum is σ = 566160593656224. Its totient is φ = 53920056538656.
The previous prime is 202200212019997. The next prime is 202200212020057. The reversal of 202200212020020 is 20020212002202.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1685001766774 + ... + 1685001766893.
It is an arithmetic number, because the mean of its divisors is an integer number (23590024735676).
Almost surely, 2202200212020020 is an apocalyptic number.
202200212020020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
202200212020020 is an abundant number, since it is smaller than the sum of its proper divisors (363960381636204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
202200212020020 is a wasteful number, since it uses less digits than its factorization.
202200212020020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3370003533679 (or 3370003533677 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 15.
Adding to 202200212020020 its reverse (20020212002202), we get a palindrome (222220424022222).
The spelling of 202200212020020 in words is "two hundred two trillion, two hundred billion, two hundred twelve million, twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •