Base | Representation |
---|---|
bin | 1001001011111101100001… |
… | …11101000110110111100100 |
3 | 2122112022102001102212120110 |
4 | 10211332300331012313210 |
5 | 10121443101200031040 |
6 | 110544432413533020 |
7 | 4153363230463641 |
oct | 445766075066744 |
9 | 78468361385513 |
10 | 20202200002020 |
11 | 648978325a323 |
12 | 23233a3aa4170 |
13 | b370a033544a |
14 | 4dbb125badc8 |
15 | 25078b527980 |
hex | 125fb0f46de4 |
20202200002020 has 96 divisors (see below), whose sum is σ = 58096688025600. Its totient is φ = 5241497347584.
The previous prime is 20202200002009. The next prime is 20202200002063. The reversal of 20202200002020 is 2020000220202.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 20202200001987 and 20202200002005.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 88306141 + ... + 88534619.
It is an arithmetic number, because the mean of its divisors is an integer number (605173833600).
Almost surely, 220202200002020 is an apocalyptic number.
20202200002020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20202200002020 is an abundant number, since it is smaller than the sum of its proper divisors (37894488023580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20202200002020 is a wasteful number, since it uses less digits than its factorization.
20202200002020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 268357 (or 268355 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 12.
Adding to 20202200002020 its reverse (2020000220202), we get a palindrome (22222200222222).
The spelling of 20202200002020 in words is "twenty trillion, two hundred two billion, two hundred million, two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •