Base | Representation |
---|---|
bin | 101101111110011001101000… |
… | …010011001011111100100101 |
3 | 222111221011010000010222202102 |
4 | 231332121220103023330211 |
5 | 203000322022334034341 |
6 | 1554013255424421445 |
7 | 60406324644524135 |
oct | 5576315023137445 |
9 | 874834100128672 |
10 | 202200220221221 |
11 | 594776a4a69842 |
12 | 1a817910777885 |
13 | 88a9525659721 |
14 | 37d078591cac5 |
15 | 1859a599e1c9b |
hex | b7e6684cbf25 |
202200220221221 has 16 divisors (see below), whose sum is σ = 206182513974528. Its totient is φ = 198252398534400.
The previous prime is 202200220221137. The next prime is 202200220221299. The reversal of 202200220221221 is 122122022002202.
It is a cyclic number.
It is not a de Polignac number, because 202200220221221 - 210 = 202200220220197 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202200220221193 and 202200220221202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202200220271221) 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, 1013066 + ... + 20135211.
It is an arithmetic number, because the mean of its divisors is an integer number (12886407123408).
Almost surely, 2202200220221221 is an apocalyptic number.
It is an amenable number.
202200220221221 is a deficient number, since it is larger than the sum of its proper divisors (3982293753307).
202200220221221 is a wasteful number, since it uses less digits than its factorization.
202200220221221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21149092.
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 202200220221221 its reverse (122122022002202), we get a palindrome (324322242223423).
The spelling of 202200220221221 in words is "two hundred two trillion, two hundred billion, two hundred twenty million, two hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •