Base | Representation |
---|---|
bin | 11101011001011110000… |
… | …001111111101000101100 |
3 | 21011010112001200111220121 |
4 | 131121132001333220230 |
5 | 231044343311211340 |
6 | 4144023410454324 |
7 | 265645512312451 |
oct | 35313601775054 |
9 | 7133461614817 |
10 | 2020212210220 |
11 | 709849142556 |
12 | 287644b943a4 |
13 | 118674bacb89 |
14 | 6dac9015828 |
15 | 3783c6b594a |
hex | 1d65e07fa2c |
2020212210220 has 24 divisors (see below), whose sum is σ = 4268472922224. Its totient is φ = 803127306816.
The previous prime is 2020212210169. The next prime is 2020212210253. The reversal of 2020212210220 is 220122120202.
It is a junction number, because it is equal to n+sod(n) for n = 2020212210194 and 2020212210203.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 309845239 + ... + 309851758.
It is an arithmetic number, because the mean of its divisors is an integer number (177853038426).
Almost surely, 22020212210220 is an apocalyptic number.
2020212210220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2020212210220 is an abundant number, since it is smaller than the sum of its proper divisors (2248260712004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2020212210220 is a wasteful number, since it uses less digits than its factorization.
2020212210220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 619697169 (or 619697167 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 2020212210220 its reverse (220122120202), we get a palindrome (2240334330422).
The spelling of 2020212210220 in words is "two trillion, twenty billion, two hundred twelve million, two hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •