Base | Representation |
---|---|
bin | 11101001000100111110… |
… | …010000101110001001101 |
3 | 21002101211100010220002011 |
4 | 131020213302011301031 |
5 | 230300321240432224 |
6 | 4131432351101221 |
7 | 264435311632324 |
oct | 35104762056115 |
9 | 7071740126064 |
10 | 2002122202189 |
11 | 70210587379a |
12 | 284036811811 |
13 | 116a51126b05 |
14 | 6cc906790bb |
15 | 3712e47d394 |
hex | 1d227c85c4d |
2002122202189 has 4 divisors (see below), whose sum is σ = 2002235996124. Its totient is φ = 2002008408256.
The previous prime is 2002122202187. The next prime is 2002122202219. The reversal of 2002122202189 is 9812022212002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 242917879689 + 1759204322500 = 492867^2 + 1326350^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002122202189 - 21 = 2002122202187 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 2002122202189.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002122202187) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56870572 + ... + 56905765.
It is an arithmetic number, because the mean of its divisors is an integer number (500558999031).
Almost surely, 22002122202189 is an apocalyptic number.
It is an amenable number.
2002122202189 is a deficient number, since it is larger than the sum of its proper divisors (113793935).
2002122202189 is a wasteful number, since it uses less digits than its factorization.
2002122202189 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113793934.
The product of its (nonzero) digits is 4608, while the sum is 31.
The spelling of 2002122202189 in words is "two trillion, two billion, one hundred twenty-two million, two hundred two thousand, one hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •