Base | Representation |
---|---|
bin | 111000111010001101… |
… | …1000000001110101001 |
3 | 102200110012001010020111 |
4 | 1301310123000032221 |
5 | 4000242323221134 |
6 | 132051002054321 |
7 | 11554351403302 |
oct | 1616433001651 |
9 | 380405033214 |
10 | 122212320169 |
11 | 47914739aa5 |
12 | 1b8287aa3a1 |
13 | b6a8640664 |
14 | 5cb50ad7a9 |
15 | 32a4307c64 |
hex | 1c746c03a9 |
122212320169 has 2 divisors, whose sum is σ = 122212320170. Its totient is φ = 122212320168.
The previous prime is 122212320137. The next prime is 122212320247. The reversal of 122212320169 is 961023212221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 108644729769 + 13567590400 = 329613^2 + 116480^2 .
It is a cyclic number.
It is not a de Polignac number, because 122212320169 - 25 = 122212320137 is a prime.
It is a super-2 number, since 2×1222123201692 (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 122212320169.
It is not a weakly prime, because it can be changed into another prime (122212320569) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61106160084 + 61106160085.
It is an arithmetic number, because the mean of its divisors is an integer number (61106160085).
Almost surely, 2122212320169 is an apocalyptic number.
It is an amenable number.
122212320169 is a deficient number, since it is larger than the sum of its proper divisors (1).
122212320169 is an equidigital number, since it uses as much as digits as its factorization.
122212320169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 122212320169 in words is "one hundred twenty-two billion, two hundred twelve million, three hundred twenty thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.151 sec. • engine limits •