Base | Representation |
---|---|
bin | 11011101111010110011000… |
… | …111000111111110100110111 |
3 | 120222222012012012101200122211 |
4 | 123233112120320333310313 |
5 | 111442331233421334312 |
6 | 1111250311533034251 |
7 | 34461201160104523 |
oct | 3357263070776467 |
9 | 528865165350584 |
10 | 122001111121207 |
11 | 3596742073588a |
12 | 11824771325987 |
13 | 530c869c369c6 |
14 | 221ac57314d83 |
15 | e187dee643a7 |
hex | 6ef598e3fd37 |
122001111121207 has 2 divisors, whose sum is σ = 122001111121208. Its totient is φ = 122001111121206.
The previous prime is 122001111121177. The next prime is 122001111121289. The reversal of 122001111121207 is 702121111100221.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122001111121207 is a prime.
It is a super-2 number, since 2×1220011111212072 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122001111161207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61000555560603 + 61000555560604.
It is an arithmetic number, because the mean of its divisors is an integer number (61000555560604).
Almost surely, 2122001111121207 is an apocalyptic number.
122001111121207 is a deficient number, since it is larger than the sum of its proper divisors (1).
122001111121207 is an equidigital number, since it uses as much as digits as its factorization.
122001111121207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112, while the sum is 22.
Adding to 122001111121207 its reverse (702121111100221), we get a palindrome (824122222221428).
The spelling of 122001111121207 in words is "one hundred twenty-two trillion, one billion, one hundred eleven million, one hundred twenty-one thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •