Base | Representation |
---|---|
bin | 1011000110001101000110… |
… | …0000100111111110111001 |
3 | 1121012102111010222110122012 |
4 | 2301203101200213332321 |
5 | 3044401100330024121 |
6 | 41541055234135305 |
7 | 2366336441515556 |
oct | 261432140477671 |
9 | 47172433873565 |
10 | 12201222111161 |
11 | 3984566884226 |
12 | 1450818721535 |
13 | 6a6754c75555 |
14 | 302784107a2d |
15 | 1625ad7ebc5b |
hex | b18d1827fb9 |
12201222111161 has 2 divisors, whose sum is σ = 12201222111162. Its totient is φ = 12201222111160.
The previous prime is 12201222111109. The next prime is 12201222111167. The reversal of 12201222111161 is 16111122210221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12169806675625 + 31415435536 = 3488525^2 + 177244^2 .
It is a cyclic number.
It is not a de Polignac number, because 12201222111161 - 210 = 12201222110137 is a prime.
It is not a weakly prime, because it can be changed into another prime (12201222111167) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6100611055580 + 6100611055581.
It is an arithmetic number, because the mean of its divisors is an integer number (6100611055581).
Almost surely, 212201222111161 is an apocalyptic number.
It is an amenable number.
12201222111161 is a deficient number, since it is larger than the sum of its proper divisors (1).
12201222111161 is an equidigital number, since it uses as much as digits as its factorization.
12201222111161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 23.
Adding to 12201222111161 its reverse (16111122210221), we get a palindrome (28312344321382).
The spelling of 12201222111161 in words is "twelve trillion, two hundred one billion, two hundred twenty-two million, one hundred eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •