Base | Representation |
---|---|
bin | 110000000001100000110110… |
… | …001100111100001111000100 |
3 | 1000200211111111110101121200201 |
4 | 300001200312030330033010 |
5 | 210140432013101011322 |
6 | 2025112345221020244 |
7 | 62326302113456242 |
oct | 6001406614741704 |
9 | 1020744443347621 |
10 | 211210221110212 |
11 | 6133082a639885 |
12 | 1b831b57854684 |
13 | 90b10664583bc |
14 | 3a228b4919792 |
15 | 19640e11a4d27 |
hex | c0183633c3c4 |
211210221110212 has 12 divisors (see below), whose sum is σ = 369620704620076. Its totient is φ = 105604305504480.
The previous prime is 211210221110153. The next prime is 211210221110263. The reversal of 211210221110212 is 212011122012112.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 142779174552576 + 68431046557636 = 11949024^2 + 8272306^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 211210221110212.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 200672163 + ... + 201721930.
Almost surely, 2211210221110212 is an apocalyptic number.
It is an amenable number.
211210221110212 is a deficient number, since it is larger than the sum of its proper divisors (158410483509864).
211210221110212 is a wasteful number, since it uses less digits than its factorization.
211210221110212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402525318 (or 402525316 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 211210221110212 its reverse (212011122012112), we get a palindrome (423221343122324).
The spelling of 211210221110212 in words is "two hundred eleven trillion, two hundred ten billion, two hundred twenty-one million, one hundred ten thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •