Base | Representation |
---|---|
bin | 101101011110101011010101… |
… | …000110011010010001101100 |
3 | 222020012202002210122021010021 |
4 | 231132223111012122101230 |
5 | 202204112333230432340 |
6 | 1545224002400451524 |
7 | 60062661034230331 |
oct | 5536532506322154 |
9 | 866182083567107 |
10 | 200020202202220 |
11 | 58807100699944 |
12 | 1a525309019ba4 |
13 | 877ba938122aa |
14 | 375705ab02988 |
15 | 181ceb794be4a |
hex | b5ead519a46c |
200020202202220 has 48 divisors (see below), whose sum is σ = 420605502710400. Its totient is φ = 79900870533120.
The previous prime is 200020202202193. The next prime is 200020202202241. The reversal of 200020202202220 is 22202202020002.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 200020202202194 and 200020202202203.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 73900996 + ... + 76559764.
It is an arithmetic number, because the mean of its divisors is an integer number (8762614639800).
Almost surely, 2200020202202220 is an apocalyptic number.
200020202202220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200020202202220 is an abundant number, since it is smaller than the sum of its proper divisors (220585300508180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200020202202220 is a wasteful number, since it uses less digits than its factorization.
200020202202220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2663818 (or 2663816 counting only the distinct ones).
The product of its (nonzero) digits is 256, while the sum is 16.
Adding to 200020202202220 its reverse (22202202020002), we get a palindrome (222222404222222).
The spelling of 200020202202220 in words is "two hundred trillion, twenty billion, two hundred two million, two hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •