Base | Representation |
---|---|
bin | 111000111001111010… |
… | …0000110011101111111 |
3 | 102200102110212000010122 |
4 | 1301303310012131333 |
5 | 4000232220401421 |
6 | 132045555325155 |
7 | 11554165620326 |
oct | 1616364063577 |
9 | 380373760118 |
10 | 122202122111 |
11 | 47909a04053 |
12 | 1b8252b07bb |
13 | b6a64ac8c4 |
14 | 5cb39b70bd |
15 | 32a34912ab |
hex | 1c73d0677f |
122202122111 has 2 divisors, whose sum is σ = 122202122112. Its totient is φ = 122202122110.
The previous prime is 122202122099. The next prime is 122202122113. The reversal of 122202122111 is 111221202221.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122202122111 is a prime.
It is a Sophie Germain prime.
Together with 122202122113, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122202122111.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (122202122113) 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, 61101061055 + 61101061056.
It is an arithmetic number, because the mean of its divisors is an integer number (61101061056).
Almost surely, 2122202122111 is an apocalyptic number.
122202122111 is a deficient number, since it is larger than the sum of its proper divisors (1).
122202122111 is an equidigital number, since it uses as much as digits as its factorization.
122202122111 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 17.
Adding to 122202122111 its reverse (111221202221), we get a palindrome (233423324332).
The spelling of 122202122111 in words is "one hundred twenty-two billion, two hundred two million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •