Base | Representation |
---|---|
bin | 1100010110001000110… |
… | …1100010000110011101 |
3 | 202021110200122212201221 |
4 | 3011202031202012131 |
5 | 11433340341042341 |
6 | 241234330533341 |
7 | 21216030464365 |
oct | 3054215420635 |
9 | 667420585657 |
10 | 212101112221 |
11 | 81a51603999 |
12 | 35134297251 |
13 | 170023c67cb |
14 | a3a12dd9a5 |
15 | 57b5a18ed1 |
hex | 316236219d |
212101112221 has 8 divisors (see below), whose sum is σ = 227283404544. Its totient is φ = 197219459520.
The previous prime is 212101112131. The next prime is 212101112243. The reversal of 212101112221 is 122211101212.
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 212101112221 - 29 = 212101111709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 212101112195 and 212101112204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212101112261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75158445 + ... + 75161266.
It is an arithmetic number, because the mean of its divisors is an integer number (28410425568).
Almost surely, 2212101112221 is an apocalyptic number.
It is an amenable number.
212101112221 is a deficient number, since it is larger than the sum of its proper divisors (15182292323).
212101112221 is a wasteful number, since it uses less digits than its factorization.
212101112221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150319811.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 212101112221 its reverse (122211101212), we get a palindrome (334312213433).
The spelling of 212101112221 in words is "two hundred twelve billion, one hundred one million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •