Base | Representation |
---|---|
bin | 1010000000010110010101… |
… | …00100101111101011011101 |
3 | 2212220101120121201221202201 |
4 | 11000023022210233223131 |
5 | 10340441022101321341 |
6 | 114443403021251501 |
7 | 4430415356522056 |
oct | 500131244575335 |
9 | 85811517657681 |
10 | 22002221120221 |
11 | 70130a9253371 |
12 | 2574217403b91 |
13 | c37a53a62a14 |
14 | 560cadac572d |
15 | 2824dcd53331 |
hex | 1402ca92fadd |
22002221120221 has 2 divisors, whose sum is σ = 22002221120222. Its totient is φ = 22002221120220.
The previous prime is 22002221120177. The next prime is 22002221120237. The reversal of 22002221120221 is 12202112220022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18085032022500 + 3917189097721 = 4252650^2 + 1979189^2 .
It is a cyclic number.
It is not a de Polignac number, because 22002221120221 - 215 = 22002221087453 is a prime.
It is a super-2 number, since 2×220022211202212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22002221120921) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11001110560110 + 11001110560111.
It is an arithmetic number, because the mean of its divisors is an integer number (11001110560111).
Almost surely, 222002221120221 is an apocalyptic number.
It is an amenable number.
22002221120221 is a deficient number, since it is larger than the sum of its proper divisors (1).
22002221120221 is an equidigital number, since it uses as much as digits as its factorization.
22002221120221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 22002221120221 its reverse (12202112220022), we get a palindrome (34204333340243).
The spelling of 22002221120221 in words is "twenty-two trillion, two billion, two hundred twenty-one million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •