Base | Representation |
---|---|
bin | 11101011001011110100… |
… | …111101110001011110011 |
3 | 21011010112202021222102120 |
4 | 131121132213232023303 |
5 | 231044403324201321 |
6 | 4144024402445323 |
7 | 265645662343320 |
oct | 35313647561363 |
9 | 7133482258376 |
10 | 2020222100211 |
11 | 709853787aa7 |
12 | 287648363843 |
13 | 118676c63643 |
14 | 6daca46bb47 |
15 | 3783d4baec6 |
hex | 1d65e9ee2f3 |
2020222100211 has 24 divisors (see below), whose sum is σ = 3163883304960. Its totient is φ = 1123212271392.
The previous prime is 2020222100209. The next prime is 2020222100213. The reversal of 2020222100211 is 1120012220202.
It is an interprime number because it is at equal distance from previous prime (2020222100209) and next prime (2020222100213).
It is not a de Polignac number, because 2020222100211 - 21 = 2020222100209 is a prime.
It is not an unprimeable number, because it can be changed into a prime (2020222100213) 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, 35106771 + ... + 35164268.
It is an arithmetic number, because the mean of its divisors is an integer number (131828471040).
Almost surely, 22020222100211 is an apocalyptic number.
2020222100211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2020222100211 is a deficient number, since it is larger than the sum of its proper divisors (1143661204749).
2020222100211 is an equidigital number, since it uses as much as digits as its factorization.
2020222100211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70271123 (or 70271086 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2020222100211 its reverse (1120012220202), we get a palindrome (3140234320413).
The spelling of 2020222100211 in words is "two trillion, twenty billion, two hundred twenty-two million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •