Base | Representation |
---|---|
bin | 111000111010011111… |
… | …1111101111100001001 |
3 | 102200110212021102100121 |
4 | 1301310333331330021 |
5 | 4000302313310441 |
6 | 132051545503241 |
7 | 11554526642011 |
oct | 1616477757411 |
9 | 380425242317 |
10 | 122222010121 |
11 | 4791a158222 |
12 | 1b82baa1b21 |
13 | b6aa654063 |
14 | 5cb64b2c41 |
15 | 32a50bddd1 |
hex | 1c74ffdf09 |
122222010121 has 2 divisors, whose sum is σ = 122222010122. Its totient is φ = 122222010120.
The previous prime is 122222010109. The next prime is 122222010133. The reversal of 122222010121 is 121010222221.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (122222010109) and next prime (122222010133).
It can be written as a sum of positive squares in only one way, i.e., 100844353600 + 21377656521 = 317560^2 + 146211^2 .
It is a cyclic number.
It is not a de Polignac number, because 122222010121 - 213 = 122222001929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122222010095 and 122222010104.
It is not a weakly prime, because it can be changed into another prime (122222010181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61111005060 + 61111005061.
It is an arithmetic number, because the mean of its divisors is an integer number (61111005061).
Almost surely, 2122222010121 is an apocalyptic number.
It is an amenable number.
122222010121 is a deficient number, since it is larger than the sum of its proper divisors (1).
122222010121 is an equidigital number, since it uses as much as digits as its factorization.
122222010121 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 16.
Adding to 122222010121 its reverse (121010222221), we get a palindrome (243232232342).
The spelling of 122222010121 in words is "one hundred twenty-two billion, two hundred twenty-two million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •