Base | Representation |
---|---|
bin | 11011101111100000101111… |
… | …000010000011001010011001 |
3 | 121000000020212101201202211111 |
4 | 123233200233002003022121 |
5 | 111443022011310324121 |
6 | 1111255350131100321 |
7 | 34462043361110014 |
oct | 3357405702031231 |
9 | 530006771652744 |
10 | 122012220011161 |
11 | 35971101387277 |
12 | 118269517416a1 |
13 | 531091a59837c |
14 | 221b5cc84c37b |
15 | e18c403622e1 |
hex | 6ef82f083299 |
122012220011161 has 2 divisors, whose sum is σ = 122012220011162. Its totient is φ = 122012220011160.
The previous prime is 122012220011009. The next prime is 122012220011173. The reversal of 122012220011161 is 161110022210221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 117808100355136 + 4204119656025 = 10853944^2 + 2050395^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122012220011161 is a prime.
It is not a weakly prime, because it can be changed into another prime (122012220012161) 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, 61006110005580 + 61006110005581.
It is an arithmetic number, because the mean of its divisors is an integer number (61006110005581).
Almost surely, 2122012220011161 is an apocalyptic number.
It is an amenable number.
122012220011161 is a deficient number, since it is larger than the sum of its proper divisors (1).
122012220011161 is an equidigital number, since it uses as much as digits as its factorization.
122012220011161 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 22.
Adding to 122012220011161 its reverse (161110022210221), we get a palindrome (283122242221382).
The spelling of 122012220011161 in words is "one hundred twenty-two trillion, twelve billion, two hundred twenty million, eleven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •