Base | Representation |
---|---|
bin | 11011110010010000101010… |
… | …011010001011100111110011 |
3 | 121000200022110020021220001201 |
4 | 123302100222122023213303 |
5 | 112004120343434342321 |
6 | 1111522230415112031 |
7 | 34511511461115343 |
oct | 3362205232134763 |
9 | 530608406256051 |
10 | 122201121012211 |
11 | 35a3422804226a |
12 | 11857490212617 |
13 | 5325693309c37 |
14 | 22267cc84cd23 |
15 | e1dae91de291 |
hex | 6f242a68b9f3 |
122201121012211 has 2 divisors, whose sum is σ = 122201121012212. Its totient is φ = 122201121012210.
The previous prime is 122201121012193. The next prime is 122201121012259. The reversal of 122201121012211 is 112210121102221.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (112210121102221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122201121012211 - 239 = 121651365198323 is a prime.
It is a super-2 number, since 2×1222011210122112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (122201121016211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61100560506105 + 61100560506106.
It is an arithmetic number, because the mean of its divisors is an integer number (61100560506106).
Almost surely, 2122201121012211 is an apocalyptic number.
122201121012211 is a deficient number, since it is larger than the sum of its proper divisors (1).
122201121012211 is an equidigital number, since it uses as much as digits as its factorization.
122201121012211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 122201121012211 its reverse (112210121102221), we get a palindrome (234411242114432).
The spelling of 122201121012211 in words is "one hundred twenty-two trillion, two hundred one billion, one hundred twenty-one million, twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •