Base | Representation |
---|---|
bin | 1100010110001011011… |
… | …1111001111111011001 |
3 | 202021111110120012220122 |
4 | 3011202313321333121 |
5 | 11433401212020441 |
6 | 241235405003025 |
7 | 21216224060054 |
oct | 3054267717731 |
9 | 667443505818 |
10 | 212112220121 |
11 | 81a5790047a |
12 | 35137b53475 |
13 | 170047b5729 |
14 | a3a2991a9b |
15 | 57b69b034b |
hex | 3162df9fd9 |
212112220121 has 4 divisors (see below), whose sum is σ = 223276021200. Its totient is φ = 200948419044.
The previous prime is 212112220087. The next prime is 212112220141. The reversal of 212112220121 is 121022211212.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 212112220121 - 26 = 212112220057 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 212112220121.
It is not an unprimeable number, because it can be changed into a prime (212112220141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5581900511 + ... + 5581900548.
It is an arithmetic number, because the mean of its divisors is an integer number (55819005300).
Almost surely, 2212112220121 is an apocalyptic number.
It is an amenable number.
212112220121 is a deficient number, since it is larger than the sum of its proper divisors (11163801079).
212112220121 is a wasteful number, since it uses less digits than its factorization.
212112220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11163801078.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 212112220121 its reverse (121022211212), we get a palindrome (333134431333).
The spelling of 212112220121 in words is "two hundred twelve billion, one hundred twelve million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •