Base | Representation |
---|---|
bin | 11011110010010001011110… |
… | …110111001001110010011111 |
3 | 121000200101201120012000200222 |
4 | 123302101132313021302133 |
5 | 112004124144230201421 |
6 | 1111522454012511555 |
7 | 34511542335066023 |
oct | 3362213667116237 |
9 | 530611646160628 |
10 | 122202001022111 |
11 | 35a3463986077a |
12 | 11857696a7b5bb |
13 | 53257a372485a |
14 | 2226873684383 |
15 | e1db4b5bccab |
hex | 6f245edc9c9f |
122202001022111 has 2 divisors, whose sum is σ = 122202001022112. Its totient is φ = 122202001022110.
The previous prime is 122202001022069. The next prime is 122202001022147. The reversal of 122202001022111 is 111220100202221.
It is a strong prime.
It is an emirp because it is prime and its reverse (111220100202221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122202001022111 - 26 = 122202001022047 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122202001022111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122202001322111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61101000511055 + 61101000511056.
It is an arithmetic number, because the mean of its divisors is an integer number (61101000511056).
Almost surely, 2122202001022111 is an apocalyptic number.
122202001022111 is a deficient number, since it is larger than the sum of its proper divisors (1).
122202001022111 is an equidigital number, since it uses as much as digits as its factorization.
122202001022111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 122202001022111 its reverse (111220100202221), we get a palindrome (233422101224332).
The spelling of 122202001022111 in words is "one hundred twenty-two trillion, two hundred two billion, one million, twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •