Base | Representation |
---|---|
bin | 11011110010011010000100… |
… | …010111100100100111011111 |
3 | 121000201021112001201101222102 |
4 | 123302122010113210213133 |
5 | 112004302034333242231 |
6 | 1111531020504035315 |
7 | 34512316651651145 |
oct | 3362320427444737 |
9 | 530637461641872 |
10 | 122211220212191 |
11 | 35a3853a851730 |
12 | 1185942a462b3b |
13 | 532661271aa06 |
14 | 22270a9c35595 |
15 | e1dedab44acb |
hex | 6f26845e49df |
122211220212191 has 16 divisors (see below), whose sum is σ = 135203106721536. Its totient is φ = 109533055800000.
The previous prime is 122211220212187. The next prime is 122211220212227. The reversal of 122211220212191 is 191212022112221.
It is a cyclic number.
It is not a de Polignac number, because 122211220212191 - 22 = 122211220212187 is a prime.
It is a super-2 number, since 2×1222112202121912 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (122211220212101) 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, 24219716 + ... + 28827366.
It is an arithmetic number, because the mean of its divisors is an integer number (8450194170096).
Almost surely, 2122211220212191 is an apocalyptic number.
122211220212191 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
122211220212191 is a deficient number, since it is larger than the sum of its proper divisors (12991886509345).
122211220212191 is a wasteful number, since it uses less digits than its factorization.
122211220212191 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4641694.
The product of its (nonzero) digits is 1152, while the sum is 29.
The spelling of 122211220212191 in words is "one hundred twenty-two trillion, two hundred eleven billion, two hundred twenty million, two hundred twelve thousand, one hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •