Base | Representation |
---|---|
bin | 110000001110011111011001… |
… | …000001110111000101011001 |
3 | 1000210222202100211122002100220 |
4 | 300032133121001313011121 |
5 | 210300034404321401014 |
6 | 2031034152503550253 |
7 | 62450602363502151 |
oct | 6016373101670531 |
9 | 1023882324562326 |
10 | 212102011122009 |
11 | 61644a59876a58 |
12 | 1b95695a45b389 |
13 | 914719802aa08 |
14 | 3a53b137b5761 |
15 | 197c3d7a576a9 |
hex | c0e7d9077159 |
212102011122009 has 16 divisors (see below), whose sum is σ = 290283759901440. Its totient is φ = 137705598422480.
The previous prime is 212102011121989. The next prime is 212102011122047. The reversal of 212102011122009 is 900221110201212.
212102011122009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 212102011122009 - 27 = 212102011121881 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 212102011122009.
It is not an unprimeable number, because it can be changed into a prime (212102011122709) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5599590627 + ... + 5599628504.
It is an arithmetic number, because the mean of its divisors is an integer number (18142734993840).
Almost surely, 2212102011122009 is an apocalyptic number.
It is an amenable number.
212102011122009 is a deficient number, since it is larger than the sum of its proper divisors (78181748779431).
212102011122009 is a wasteful number, since it uses less digits than its factorization.
212102011122009 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11199219300.
The product of its (nonzero) digits is 288, while the sum is 24.
The spelling of 212102011122009 in words is "two hundred twelve trillion, one hundred two billion, eleven million, one hundred twenty-two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •