Base | Representation |
---|---|
bin | 11101011001011110100… |
… | …011111001111111110101 |
3 | 21011010112200102011102111 |
4 | 131121132203321333311 |
5 | 231044403100200041 |
6 | 4144024325211021 |
7 | 265645651006315 |
oct | 35313643717765 |
9 | 7133480364374 |
10 | 2020221100021 |
11 | 7098531645a3 |
12 | 287647b60a71 |
13 | 1186769a3307 |
14 | 6daca28b445 |
15 | 3783d36e981 |
hex | 1d65e8f9ff5 |
2020221100021 has 8 divisors (see below), whose sum is σ = 2076309617184. Its totient is φ = 1964546520720.
The previous prime is 2020221100019. The next prime is 2020221100039. The reversal of 2020221100021 is 1200011220202.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2020221100021 - 21 = 2020221100019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2020221099974 and 2020221100010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2020221130021) 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, 103474570 + ... + 103494091.
It is an arithmetic number, because the mean of its divisors is an integer number (259538702148).
Almost surely, 22020221100021 is an apocalyptic number.
It is an amenable number.
2020221100021 is a deficient number, since it is larger than the sum of its proper divisors (56088517163).
2020221100021 is a wasteful number, since it uses less digits than its factorization.
2020221100021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 206968931.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 2020221100021 its reverse (1200011220202), we get a palindrome (3220232320223).
The spelling of 2020221100021 in words is "two trillion, twenty billion, two hundred twenty-one million, one hundred thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •