Base | Representation |
---|---|
bin | 110000001101001001111001… |
… | …011000110110000010100011 |
3 | 1000210122222102012210202002122 |
4 | 300031021321120312002203 |
5 | 210242033403312033331 |
6 | 2030524051422534455 |
7 | 62441142461636414 |
oct | 6015117130660243 |
9 | 1023588365722078 |
10 | 212010212221091 |
11 | 6160a031781a99 |
12 | 1b940bbb13742b |
13 | 913b628611a2b |
14 | 3a4d4c5a0980b |
15 | 1979d137dd17b |
hex | c0d2796360a3 |
212010212221091 has 2 divisors, whose sum is σ = 212010212221092. Its totient is φ = 212010212221090.
The previous prime is 212010212221081. The next prime is 212010212221109. The reversal of 212010212221091 is 190122212010212.
Together with next prime (212010212221109) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212010212221091 is a prime.
It is a super-2 number, since 2×2120102122210912 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 212010212221091.
It is not a weakly prime, because it can be changed into another prime (212010212221081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106005106110545 + 106005106110546.
It is an arithmetic number, because the mean of its divisors is an integer number (106005106110546).
Almost surely, 2212010212221091 is an apocalyptic number.
212010212221091 is a deficient number, since it is larger than the sum of its proper divisors (1).
212010212221091 is an equidigital number, since it uses as much as digits as its factorization.
212010212221091 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 26.
The spelling of 212010212221091 in words is "two hundred twelve trillion, ten billion, two hundred twelve million, two hundred twenty-one thousand, ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •