Base | Representation |
---|---|
bin | 110000000001100010101101… |
… | …011110011111100011010110 |
3 | 1000200211200122220210111212010 |
4 | 300001202231132133203112 |
5 | 210141000112340400042 |
6 | 2025113315543205050 |
7 | 62326402522450311 |
oct | 6001425536374326 |
9 | 1020750586714763 |
10 | 211212222200022 |
11 | 6133166716020a |
12 | 1b832415a46786 |
13 | 90b12c4bc4804 |
14 | 3a22a245b9978 |
15 | 19641abbd059c |
hex | c018ad79f8d6 |
211212222200022 has 32 divisors (see below), whose sum is σ = 435757635869184. Its totient is φ = 68216328180000.
The previous prime is 211212222200009. The next prime is 211212222200069. The reversal of 211212222200022 is 220002222212112.
211212222200022 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2112122222000222 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4306561854 + ... + 4306610897.
It is an arithmetic number, because the mean of its divisors is an integer number (13617426120912).
Almost surely, 2211212222200022 is an apocalyptic number.
211212222200022 is an abundant number, since it is smaller than the sum of its proper divisors (224545413669162).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211212222200022 is a wasteful number, since it uses less digits than its factorization.
211212222200022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8613172884.
The product of its (nonzero) digits is 512, while the sum is 21.
Adding to 211212222200022 its reverse (220002222212112), we get a palindrome (431214444412134).
The spelling of 211212222200022 in words is "two hundred eleven trillion, two hundred twelve billion, two hundred twenty-two million, two hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •