Base | Representation |
---|---|
bin | 11101001111111101011… |
… | …001110010001011100101 |
3 | 21010011011102201111012210 |
4 | 131033331121302023211 |
5 | 230412440241401041 |
6 | 4135214243434033 |
7 | 265134462432144 |
oct | 35177531621345 |
9 | 7104142644183 |
10 | 2010001122021 |
11 | 705489261892 |
12 | 285675385919 |
13 | 117708555459 |
14 | 6d3dac2575b |
15 | 3744100d016 |
hex | 1d3fd6722e5 |
2010001122021 has 8 divisors (see below), whose sum is σ = 2680215894720. Its totient is φ = 1339893548672.
The previous prime is 2010001122011. The next prime is 2010001122061. The reversal of 2010001122021 is 1202211000102.
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 2010001122021 - 219 = 2010000597733 is a prime.
It is a super-2 number, since 2×20100011220212 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2010001121988 and 2010001122006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010001122011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26756076 + ... + 26831093.
It is an arithmetic number, because the mean of its divisors is an integer number (335026986840).
Almost surely, 22010001122021 is an apocalyptic number.
It is an amenable number.
2010001122021 is a deficient number, since it is larger than the sum of its proper divisors (670214772699).
2010001122021 is a wasteful number, since it uses less digits than its factorization.
2010001122021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53599675.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 2010001122021 its reverse (1202211000102), we get a palindrome (3212212122123).
The spelling of 2010001122021 in words is "two trillion, ten billion, one million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •