Base | Representation |
---|---|
bin | 11101011001011110000… |
… | …001111111110110110001 |
3 | 21011010112001200120010222 |
4 | 131121132001333312301 |
5 | 231044343311223441 |
6 | 4144023410502425 |
7 | 265645512315206 |
oct | 35313601776661 |
9 | 7133461616128 |
10 | 2020212211121 |
11 | 7098491431a5 |
12 | 287644b94a15 |
13 | 118674bb0400 |
14 | 6dac9015cad |
15 | 3783c6b5d4b |
hex | 1d65e07fdb1 |
2020212211121 has 24 divisors (see below), whose sum is σ = 2282879733120. Its totient is φ = 1783575421056.
The previous prime is 2020212211117. The next prime is 2020212211153. The reversal of 2020212211121 is 1211122120202.
It is not a de Polignac number, because 2020212211121 - 22 = 2020212211117 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2020212211121.
It is not an unprimeable number, because it can be changed into a prime (2020212219121) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 81058700 + ... + 81083618.
It is an arithmetic number, because the mean of its divisors is an integer number (95119988880).
Almost surely, 22020212211121 is an apocalyptic number.
It is an amenable number.
2020212211121 is a deficient number, since it is larger than the sum of its proper divisors (262667521999).
2020212211121 is a wasteful number, since it uses less digits than its factorization.
2020212211121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45825 (or 45812 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 2020212211121 its reverse (1211122120202), we get a palindrome (3231334331323).
It can be divided in two parts, 202021 and 2211121, that added together give a palindrome (2413142).
The spelling of 2020212211121 in words is "two trillion, twenty billion, two hundred twelve million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •