Base | Representation |
---|---|
bin | 1010000000010010100110… |
… | …11011001000100111101001 |
3 | 2212220012102022020211022211 |
4 | 11000021103123020213221 |
5 | 10340422423330042413 |
6 | 114442432411445121 |
7 | 4430315004321331 |
oct | 500112333104751 |
9 | 85805368224284 |
10 | 22000222112233 |
11 | 7012272924052 |
12 | 2573959a567a1 |
13 | c377c5875061 |
14 | 560b604080c1 |
15 | 2824225d983d |
hex | 1402536c89e9 |
22000222112233 has 2 divisors, whose sum is σ = 22000222112234. Its totient is φ = 22000222112232.
The previous prime is 22000222112179. The next prime is 22000222112249. The reversal of 22000222112233 is 33221122200022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21930376608144 + 69845504089 = 4682988^2 + 264283^2 .
It is a cyclic number.
It is not a de Polignac number, because 22000222112233 - 229 = 21999685241321 is a prime.
It is a zygodrome in base 10.
It is not a weakly prime, because it can be changed into another prime (22000222118233) 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, 11000111056116 + 11000111056117.
It is an arithmetic number, because the mean of its divisors is an integer number (11000111056117).
Almost surely, 222000222112233 is an apocalyptic number.
It is an amenable number.
22000222112233 is a deficient number, since it is larger than the sum of its proper divisors (1).
22000222112233 is an equidigital number, since it uses as much as digits as its factorization.
22000222112233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 22000222112233 its reverse (33221122200022), we get a palindrome (55221344312255).
The spelling of 22000222112233 in words is "twenty-two trillion, two hundred twenty-two million, one hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •