Base | Representation |
---|---|
bin | 11101010001000100111… |
… | …111100101000010110101 |
3 | 21010021021010210011221121 |
4 | 131101010333211002311 |
5 | 230422420231241041 |
6 | 4135533351143541 |
7 | 265206315510232 |
oct | 35210477450265 |
9 | 7107233704847 |
10 | 2011202212021 |
11 | 705a45242552 |
12 | 28594b674bb1 |
13 | 11786a33bab2 |
14 | 6d4b255a789 |
15 | 374b16b17d1 |
hex | 1d444fe50b5 |
2011202212021 has 8 divisors (see below), whose sum is σ = 2051477556800. Its totient is φ = 1971228555648.
The previous prime is 2011202211989. The next prime is 2011202212039. The reversal of 2011202212021 is 1202122021102.
It is a happy number.
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 2011202212021 - 25 = 2011202211989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2011202211986 and 2011202212004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2011202212321) 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, 75408636 + ... + 75435301.
It is an arithmetic number, because the mean of its divisors is an integer number (256434694600).
Almost surely, 22011202212021 is an apocalyptic number.
It is an amenable number.
2011202212021 is a deficient number, since it is larger than the sum of its proper divisors (40275344779).
2011202212021 is a wasteful number, since it uses less digits than its factorization.
2011202212021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150844203.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 2011202212021 its reverse (1202122021102), we get a palindrome (3213324233123).
The spelling of 2011202212021 in words is "two trillion, eleven billion, two hundred two million, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •