Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …011010000100011010000 |
3 | 21002102000202201200001211 |
4 | 131020230123100203100 |
5 | 230301001211244440 |
6 | 4131444212505504 |
7 | 264440246033620 |
oct | 35105433204320 |
9 | 7072022650054 |
10 | 2002200103120 |
11 | 702145840928 |
12 | 28405891b294 |
13 | 116a64300939 |
14 | 6cc9ab56880 |
15 | 37136219eea |
hex | 1d22c6d08d0 |
2002200103120 has 80 divisors (see below), whose sum is σ = 5320866371328. Its totient is φ = 686373811200.
The previous prime is 2002200103103. The next prime is 2002200103133. The reversal of 2002200103120 is 213010022002.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 2002200103120.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3873372 + ... + 4359748.
Almost surely, 22002200103120 is an apocalyptic number.
2002200103120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2002200103120 is an abundant number, since it is smaller than the sum of its proper divisors (3318666268208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002200103120 is a wasteful number, since it uses less digits than its factorization.
2002200103120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493748 (or 493742 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 13.
Adding to 2002200103120 its reverse (213010022002), we get a palindrome (2215210125122).
The spelling of 2002200103120 in words is "two trillion, two billion, two hundred million, one hundred three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.134 sec. • engine limits •