Base | Representation |
---|---|
bin | 111000111010011100… |
… | …1001001011100011001 |
3 | 102200110201220120211112 |
4 | 1301310321021130121 |
5 | 4000301334102413 |
6 | 132051443310105 |
7 | 11554505514344 |
oct | 1616471113431 |
9 | 380421816745 |
10 | 122220222233 |
11 | 47919146a2a |
12 | 1b82b37b335 |
13 | b6aa179335 |
14 | 5cb616945b |
15 | 32a4d692a8 |
hex | 1c74e49719 |
122220222233 has 2 divisors, whose sum is σ = 122220222234. Its totient is φ = 122220222232.
The previous prime is 122220222217. The next prime is 122220222253. The reversal of 122220222233 is 332222022221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 122201282329 + 18939904 = 349573^2 + 4352^2 .
It is a cyclic number.
It is not a de Polignac number, because 122220222233 - 24 = 122220222217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 122220222199 and 122220222208.
It is not a weakly prime, because it can be changed into another prime (122220222253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61110111116 + 61110111117.
It is an arithmetic number, because the mean of its divisors is an integer number (61110111117).
Almost surely, 2122220222233 is an apocalyptic number.
It is an amenable number.
122220222233 is a deficient number, since it is larger than the sum of its proper divisors (1).
122220222233 is an equidigital number, since it uses as much as digits as its factorization.
122220222233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 23.
Adding to 122220222233 its reverse (332222022221), we get a palindrome (454442244454).
The spelling of 122220222233 in words is "one hundred twenty-two billion, two hundred twenty million, two hundred twenty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •