Base | Representation |
---|---|
bin | 11101001000101100011… |
… | …100000011110111100000 |
3 | 21002102000210010100101201 |
4 | 131020230130003313200 |
5 | 230301001240011222 |
6 | 4131444221210544 |
7 | 264440250600463 |
oct | 35105434036740 |
9 | 7072023110351 |
10 | 2002200313312 |
11 | 702145974841 |
12 | 284058a00a54 |
13 | 116a64375504 |
14 | 6cc9abad2da |
15 | 3713625c427 |
hex | 1d22c703de0 |
2002200313312 has 48 divisors (see below), whose sum is σ = 4033978668720. Its totient is φ = 977703293952.
The previous prime is 2002200313307. The next prime is 2002200313313. The reversal of 2002200313312 is 2133130022002.
It is a self number, because there is not a number n which added to its sum of digits gives 2002200313312.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002200313313) 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, 12210364 + ... + 12373252.
It is an arithmetic number, because the mean of its divisors is an integer number (84041222265).
Almost surely, 22002200313312 is an apocalyptic number.
It is an amenable number.
2002200313312 is an abundant number, since it is smaller than the sum of its proper divisors (2031778355408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002200313312 is a wasteful number, since it uses less digits than its factorization.
2002200313312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171875 (or 171867 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
Adding to 2002200313312 its reverse (2133130022002), we get a palindrome (4135330335314).
The spelling of 2002200313312 in words is "two trillion, two billion, two hundred million, three hundred thirteen thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •