Base | Representation |
---|---|
bin | 111000110111001100… |
… | …1010001001110101101 |
3 | 102200012010202210111022 |
4 | 1301232121101032231 |
5 | 4000040431432341 |
6 | 132032550503525 |
7 | 11552013043631 |
oct | 1615631211655 |
9 | 380163683438 |
10 | 122111202221 |
11 | 47872654648 |
12 | 1b7ba964ba5 |
13 | b6906c8058 |
14 | 5ca58aadc1 |
15 | 329a4d1e4b |
hex | 1c6e6513ad |
122111202221 has 2 divisors, whose sum is σ = 122111202222. Its totient is φ = 122111202220.
The previous prime is 122111202217. The next prime is 122111202253. The reversal of 122111202221 is 122202111221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 79489599721 + 42621602500 = 281939^2 + 206450^2 .
It is a cyclic number.
It is not a de Polignac number, because 122111202221 - 22 = 122111202217 is a prime.
It is a super-2 number, since 2×1221112022212 (a number of 23 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 122111202221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122111202211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61055601110 + 61055601111.
It is an arithmetic number, because the mean of its divisors is an integer number (61055601111).
Almost surely, 2122111202221 is an apocalyptic number.
It is an amenable number.
122111202221 is a deficient number, since it is larger than the sum of its proper divisors (1).
122111202221 is an equidigital number, since it uses as much as digits as its factorization.
122111202221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 122111202221 its reverse (122202111221), we get a palindrome (244313313442).
The spelling of 122111202221 in words is "one hundred twenty-two billion, one hundred eleven million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •