Base | Representation |
---|---|
bin | 1010000000111011100100… |
… | …00100110110010011011101 |
3 | 2212222022011202121020100001 |
4 | 11000131302010312103131 |
5 | 10341302442031401341 |
6 | 114500510354134301 |
7 | 4432023631431511 |
oct | 500356204662335 |
9 | 85868152536301 |
10 | 22022211200221 |
11 | 7020627117341 |
12 | 2578075b81391 |
13 | c398bb37631b |
14 | 561c48948141 |
15 | 282caccaed31 |
hex | 1407721364dd |
22022211200221 has 2 divisors, whose sum is σ = 22022211200222. Its totient is φ = 22022211200220.
The previous prime is 22022211200203. The next prime is 22022211200243. The reversal of 22022211200221 is 12200211222022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20286115088121 + 1736096112100 = 4504011^2 + 1317610^2 .
It is a cyclic number.
It is not a de Polignac number, because 22022211200221 - 211 = 22022211198173 is a prime.
It is a super-2 number, since 2×220222112002212 (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 (22022211206221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11011105600110 + 11011105600111.
It is an arithmetic number, because the mean of its divisors is an integer number (11011105600111).
Almost surely, 222022211200221 is an apocalyptic number.
It is an amenable number.
22022211200221 is a deficient number, since it is larger than the sum of its proper divisors (1).
22022211200221 is an equidigital number, since it uses as much as digits as its factorization.
22022211200221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 22022211200221 its reverse (12200211222022), we get a palindrome (34222422422243).
The spelling of 22022211200221 in words is "twenty-two trillion, twenty-two billion, two hundred eleven million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •