Base | Representation |
---|---|
bin | 11101001000100001101… |
… | …100111110111010111001 |
3 | 21002101120020012122112210 |
4 | 131020201230332322321 |
5 | 230300114132400441 |
6 | 4131414304525333 |
7 | 264432632631234 |
oct | 35104154767271 |
9 | 7071506178483 |
10 | 2002020200121 |
11 | 702063235067 |
12 | 284008620849 |
13 | 116a35c61c66 |
14 | 6cc80cc641b |
15 | 37125530616 |
hex | 1d221b3eeb9 |
2002020200121 has 8 divisors (see below), whose sum is σ = 2785419408960. Its totient is φ = 1276650562352.
The previous prime is 2002020200111. The next prime is 2002020200129. The reversal of 2002020200121 is 1210020202002.
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 2002020200121 - 218 = 2002019937977 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2002020200097 and 2002020200106.
It is not an unprimeable number, because it can be changed into a prime (2002020200129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14507392686 + ... + 14507392823.
It is an arithmetic number, because the mean of its divisors is an integer number (348177426120).
Almost surely, 22002020200121 is an apocalyptic number.
It is an amenable number.
2002020200121 is a deficient number, since it is larger than the sum of its proper divisors (783399208839).
2002020200121 is a wasteful number, since it uses less digits than its factorization.
2002020200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29014785535.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 2002020200121 its reverse (1210020202002), we get a palindrome (3212040402123).
The spelling of 2002020200121 in words is "two trillion, two billion, twenty million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •