Base | Representation |
---|---|
bin | 11101001000101100100… |
… | …011010101011010111101 |
3 | 21002102000220201020011222 |
4 | 131020230203111122331 |
5 | 230301002232021341 |
6 | 4131444330123125 |
7 | 264440303032130 |
oct | 35105443253275 |
9 | 7072026636158 |
10 | 2002202220221 |
11 | 702146a574a5 |
12 | 2840595804a5 |
13 | 116a64892468 |
14 | 6cc9b148217 |
15 | 371364d744b |
hex | 1d22c8d56bd |
2002202220221 has 8 divisors (see below), whose sum is σ = 2310446945664. Its totient is φ = 1699511454000.
The previous prime is 2002202220197. The next prime is 2002202220269. The reversal of 2002202220221 is 1220222022002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2002202220221 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 2002202220221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002204220221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1388489030 + ... + 1388490471.
It is an arithmetic number, because the mean of its divisors is an integer number (288805868208).
Almost surely, 22002202220221 is an apocalyptic number.
It is an amenable number.
2002202220221 is a deficient number, since it is larger than the sum of its proper divisors (308244725443).
2002202220221 is a wasteful number, since it uses less digits than its factorization.
2002202220221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2776979611.
The product of its (nonzero) digits is 256, while the sum is 17.
Adding to 2002202220221 its reverse (1220222022002), we get a palindrome (3222424242223).
The spelling of 2002202220221 in words is "two trillion, two billion, two hundred two million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •