Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …011101000111100001101 |
3 | 21002102000202220202002212 |
4 | 131020230123220330031 |
5 | 230301001222444041 |
6 | 4131444215000205 |
7 | 264440246631104 |
oct | 35105433507415 |
9 | 7072022822085 |
10 | 2002200203021 |
11 | 7021458a9997 |
12 | 284058969065 |
13 | 116a64337255 |
14 | 6cc9ab8103b |
15 | 371362398eb |
hex | 1d22c6e8f0d |
2002200203021 has 6 divisors (see below), whose sum is σ = 2002512794730. Its totient is φ = 2001887657936.
The previous prime is 2002200203011. The next prime is 2002200203039. The reversal of 2002200203021 is 1203020022002.
It can be written as a sum of positive squares in 3 ways, for example, as 1358331975625 + 643868227396 = 1165475^2 + 802414^2 .
It is not a de Polignac number, because 2002200203021 - 210 = 2002200201997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002200202987 and 2002200203005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002200203011) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 65870495 + ... + 65900883.
It is an arithmetic number, because the mean of its divisors is an integer number (333752132455).
Almost surely, 22002200203021 is an apocalyptic number.
It is an amenable number.
2002200203021 is a deficient number, since it is larger than the sum of its proper divisors (312591709).
2002200203021 is an frugal number, since it uses more digits than its factorization.
2002200203021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46623 (or 38506 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 14.
Adding to 2002200203021 its reverse (1203020022002), we get a palindrome (3205220225023).
The spelling of 2002200203021 in words is "two trillion, two billion, two hundred million, two hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •