Base | Representation |
---|---|
bin | 11101000110110101010… |
… | …101001011110011101001 |
3 | 21002012212111222122012212 |
4 | 131012311111023303221 |
5 | 230232403204201441 |
6 | 4130514035014505 |
7 | 264336604443602 |
oct | 35066525136351 |
9 | 7065774878185 |
10 | 2000202022121 |
11 | 70130a995016 |
12 | 28379b73a435 |
13 | 116806378ba4 |
14 | 6cb4b63ada9 |
15 | 3706aad5eeb |
hex | 1d1b554bce9 |
2000202022121 has 8 divisors (see below), whose sum is σ = 2002021538688. Its totient is φ = 1998382698000.
The previous prime is 2000202022111. The next prime is 2000202022123. The reversal of 2000202022121 is 1212202020002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2000202022121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2000202022096 and 2000202022105.
It is not an unprimeable number, because it can be changed into a prime (2000202022123) 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, 28139936 + ... + 28210926.
It is an arithmetic number, because the mean of its divisors is an integer number (250252692336).
Almost surely, 22000202022121 is an apocalyptic number.
It is an amenable number.
2000202022121 is a deficient number, since it is larger than the sum of its proper divisors (1819516567).
2000202022121 is a wasteful number, since it uses less digits than its factorization.
2000202022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96223.
The product of its (nonzero) digits is 64, while the sum is 14.
Adding to 2000202022121 its reverse (1212202020002), we get a palindrome (3212404042123).
The spelling of 2000202022121 in words is "two trillion, two hundred two million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •