Base | Representation |
---|---|
bin | 110000001110101000110010… |
… | …100000010100001001110011 |
3 | 1000211000201102002210120202110 |
4 | 300032220302200110021303 |
5 | 210300221041131242321 |
6 | 2031042542103020403 |
7 | 62451410425400205 |
oct | 6016506240241163 |
9 | 1024021362716673 |
10 | 212112102212211 |
11 | 61649267a47423 |
12 | 1b9588b5a3a703 |
13 | 914811585c3c6 |
14 | 3a543cda8a775 |
15 | 197c7c890a176 |
hex | c0ea32814273 |
212112102212211 has 8 divisors (see below), whose sum is σ = 282816617460160. Its totient is φ = 141407827552872.
The previous prime is 212112102212177. The next prime is 212112102212237. The reversal of 212112102212211 is 112212201211212.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 212112102212211 - 247 = 71374613856883 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212112102222211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58079845 + ... + 61623798.
It is an arithmetic number, because the mean of its divisors is an integer number (35352077182520).
Almost surely, 2212112102212211 is an apocalyptic number.
212112102212211 is a deficient number, since it is larger than the sum of its proper divisors (70704515247949).
212112102212211 is a wasteful number, since it uses less digits than its factorization.
212112102212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120294305.
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 212112102212211 its reverse (112212201211212), we get a palindrome (324324303423423).
The spelling of 212112102212211 in words is "two hundred twelve trillion, one hundred twelve billion, one hundred two million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •