Base | Representation |
---|---|
bin | 110000000000001101000000… |
… | …101010001000001010111101 |
3 | 1000200111220010212222012101002 |
4 | 300000031000222020022331 |
5 | 210132443133232021341 |
6 | 2025003140523500045 |
7 | 62316634264515650 |
oct | 6000150052101275 |
9 | 1020456125865332 |
10 | 211120202220221 |
11 | 612a6636296428 |
12 | 1b818614687625 |
13 | 90a571b751018 |
14 | 3a1c3b5301897 |
15 | 1961ac334629b |
hex | c00340a882bd |
211120202220221 has 16 divisors (see below), whose sum is σ = 242879200984320. Its totient is φ = 179760956659200.
The previous prime is 211120202220217. The next prime is 211120202220229. The reversal of 211120202220221 is 122022202021112.
It is not a de Polignac number, because 211120202220221 - 22 = 211120202220217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211120202220193 and 211120202220202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211120202220229) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 456156995 + ... + 456619583.
It is an arithmetic number, because the mean of its divisors is an integer number (15179950061520).
Almost surely, 2211120202220221 is an apocalyptic number.
It is an amenable number.
211120202220221 is a deficient number, since it is larger than the sum of its proper divisors (31758998764099).
211120202220221 is a wasteful number, since it uses less digits than its factorization.
211120202220221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 894524.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 211120202220221 its reverse (122022202021112), we get a palindrome (333142404241333).
The spelling of 211120202220221 in words is "two hundred eleven trillion, one hundred twenty billion, two hundred two million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •