Base | Representation |
---|---|
bin | 110000001110110010000110… |
… | …100010011111000101011011 |
3 | 1000211001200020000011112112122 |
4 | 300032302012202133011123 |
5 | 210300402031103031021 |
6 | 2031051314241131455 |
7 | 62452213301245265 |
oct | 6016620642370533 |
9 | 1024050200145478 |
10 | 212122102002011 |
11 | 61652529628513 |
12 | 1b95a826929b8b |
13 | 914904a4a4ca6 |
14 | 3a54a9bb96b35 |
15 | 197cbb1775bab |
hex | c0ec8689f15b |
212122102002011 has 8 divisors (see below), whose sum is σ = 212814672478800. Its totient is φ = 211430465540352.
The previous prime is 212122102002001. The next prime is 212122102002059. The reversal of 212122102002011 is 110200201221212.
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 212122102002011 - 234 = 212104922132827 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212122102002001) 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, 233048825 + ... + 233957258.
It is an arithmetic number, because the mean of its divisors is an integer number (26601834059850).
Almost surely, 2212122102002011 is an apocalyptic number.
212122102002011 is a deficient number, since it is larger than the sum of its proper divisors (692570476789).
212122102002011 is a wasteful number, since it uses less digits than its factorization.
212122102002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 467007565.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 212122102002011 its reverse (110200201221212), we get a palindrome (322322303223223).
The spelling of 212122102002011 in words is "two hundred twelve trillion, one hundred twenty-two billion, one hundred two million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •