Base | Representation |
---|---|
bin | 110000001101001010101000… |
… | …011010010000100110111011 |
3 | 1000210200001110012021000121121 |
4 | 300031022220122100212323 |
5 | 210242042012241334321 |
6 | 2030524302003450111 |
7 | 62441201151322645 |
oct | 6015125032204673 |
9 | 1023601405230547 |
10 | 212011001121211 |
11 | 6160a3a7021366 |
12 | 1b94119b386937 |
13 | 913b722ba9536 |
14 | 3a4d55c6c5895 |
15 | 1979d5cbc1441 |
hex | c0d2a86909bb |
212011001121211 has 4 divisors (see below), whose sum is σ = 212011806869800. Its totient is φ = 212010195372624.
The previous prime is 212011001121151. The next prime is 212011001121221. The reversal of 212011001121211 is 112121100110212.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 212011001121211 - 211 = 212011001119163 is a prime.
It is a super-2 number, since 2×2120110011212112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (212011001121221) 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, 402479481 + ... + 403005898.
It is an arithmetic number, because the mean of its divisors is an integer number (53002951717450).
Almost surely, 2212011001121211 is an apocalyptic number.
212011001121211 is a deficient number, since it is larger than the sum of its proper divisors (805748589).
212011001121211 is an equidigital number, since it uses as much as digits as its factorization.
212011001121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 805748588.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 212011001121211 its reverse (112121100110212), we get a palindrome (324132101231423).
The spelling of 212011001121211 in words is "two hundred twelve trillion, eleven billion, one million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •