Base | Representation |
---|---|
bin | 11011110010010000100011… |
… | …010001001000110111100001 |
3 | 121000200022010212211212010221 |
4 | 123302100203101020313201 |
5 | 112004120122301413441 |
6 | 1111522210455123041 |
7 | 34511505504542023 |
oct | 3362204321106741 |
9 | 530608125755127 |
10 | 122201001201121 |
11 | 35a3417644a437 |
12 | 11857458073481 |
13 | 532567454acbb |
14 | 22267ba982013 |
15 | e1dadd9248d1 |
hex | 6f2423448de1 |
122201001201121 has 2 divisors, whose sum is σ = 122201001201122. Its totient is φ = 122201001201120.
The previous prime is 122201001201107. The next prime is 122201001201127. The reversal of 122201001201121 is 121102100102221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67582456931025 + 54618544270096 = 8220855^2 + 7390436^2 .
It is a cyclic number.
It is not a de Polignac number, because 122201001201121 - 29 = 122201001200609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122201001201095 and 122201001201104.
It is not a weakly prime, because it can be changed into another prime (122201001201127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61100500600560 + 61100500600561.
It is an arithmetic number, because the mean of its divisors is an integer number (61100500600561).
Almost surely, 2122201001201121 is an apocalyptic number.
It is an amenable number.
122201001201121 is a deficient number, since it is larger than the sum of its proper divisors (1).
122201001201121 is an equidigital number, since it uses as much as digits as its factorization.
122201001201121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 122201001201121 its reverse (121102100102221), we get a palindrome (243303101303342).
The spelling of 122201001201121 in words is "one hundred twenty-two trillion, two hundred one billion, one million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •