Base | Representation |
---|---|
bin | 111011101010111… |
… | …0010011000110111 |
3 | 12011112111022012222 |
4 | 1313111302120313 |
5 | 13100030400434 |
6 | 530402032555 |
7 | 100421264063 |
oct | 16725623067 |
9 | 5145438188 |
10 | 2002200119 |
11 | 93820a647 |
12 | 47a64875b |
13 | 25ba678ca |
14 | 14dcacaa3 |
15 | bab9972e |
hex | 77572637 |
2002200119 has 8 divisors (see below), whose sum is σ = 2039242800. Its totient is φ = 1965465216.
The previous prime is 2002200113. The next prime is 2002200121. The reversal of 2002200119 is 9110022002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2002200119 - 224 = 1985422903 is a prime.
It is a super-2 number, since 2×20022001192 = 8017610633047228322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002200097 and 2002200106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002200113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63794 + ... + 89855.
It is an arithmetic number, because the mean of its divisors is an integer number (254905350).
Almost surely, 22002200119 is an apocalyptic number.
2002200119 is a deficient number, since it is larger than the sum of its proper divisors (37042681).
2002200119 is a wasteful number, since it uses less digits than its factorization.
2002200119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153889.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 2002200119 is about 44745.9508670896. The cubic root of 2002200119 is about 1260.3828766307.
The spelling of 2002200119 in words is "two billion, two million, two hundred thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •