Base | Representation |
---|---|
bin | 1010000000010110010010… |
… | …11100101001011011001001 |
3 | 2212220101112022011201212011 |
4 | 11000023021130221123021 |
5 | 10340441002232021413 |
6 | 114443401104215521 |
7 | 4430415040054054 |
oct | 500131134513311 |
9 | 85811468151764 |
10 | 22002202220233 |
11 | 7013099614544 |
12 | 257421100a5a1 |
13 | c37a4cb761b1 |
14 | 560cab3a5a9b |
15 | 2824db36d33d |
hex | 1402c97296c9 |
22002202220233 has 2 divisors, whose sum is σ = 22002202220234. Its totient is φ = 22002202220232.
The previous prime is 22002202220179. The next prime is 22002202220279. The reversal of 22002202220233 is 33202220220022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11474532958464 + 10527669261769 = 3387408^2 + 3244637^2 .
It is a cyclic number.
It is not a de Polignac number, because 22002202220233 - 29 = 22002202219721 is a prime.
It is not a weakly prime, because it can be changed into another prime (22002202220333) 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, 11001101110116 + 11001101110117.
It is an arithmetic number, because the mean of its divisors is an integer number (11001101110117).
Almost surely, 222002202220233 is an apocalyptic number.
It is an amenable number.
22002202220233 is a deficient number, since it is larger than the sum of its proper divisors (1).
22002202220233 is an equidigital number, since it uses as much as digits as its factorization.
22002202220233 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 22.
Adding to 22002202220233 its reverse (33202220220022), we get a palindrome (55204422440255).
The spelling of 22002202220233 in words is "twenty-two trillion, two billion, two hundred two million, two hundred twenty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •