Base | Representation |
---|---|
bin | 1001001011111101001100… |
… | …01110100001111100110101 |
3 | 2122112021221111202211200111 |
4 | 10211332212032201330311 |
5 | 10121442214111120041 |
6 | 110544402504143021 |
7 | 4153355613612040 |
oct | 445764616417465 |
9 | 78467844684614 |
10 | 20202020020021 |
11 | 64896a06aa174 |
12 | 2323353767a71 |
13 | b37071c69818 |
14 | 4dbad6729c57 |
15 | 25077a824981 |
hex | 125fa63a1f35 |
20202020020021 has 64 divisors (see below), whose sum is σ = 24009720053760. Its totient is φ = 16642543357440.
The previous prime is 20202020019953. The next prime is 20202020020031. The reversal of 20202020020021 is 12002002020202.
It is not a de Polignac number, because 20202020020021 - 231 = 20199872536373 is a prime.
It is a super-2 number, since 2×202020200200212 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20202020019983 and 20202020020010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20202020020031) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1553636506 + ... + 1553649508.
It is an arithmetic number, because the mean of its divisors is an integer number (375151875840).
Almost surely, 220202020020021 is an apocalyptic number.
It is an amenable number.
20202020020021 is a deficient number, since it is larger than the sum of its proper divisors (3807700033739).
20202020020021 is a wasteful number, since it uses less digits than its factorization.
20202020020021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13586.
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 20202020020021 its reverse (12002002020202), we get a palindrome (32204022040223).
The spelling of 20202020020021 in words is "twenty trillion, two hundred two billion, twenty million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •