Base | Representation |
---|---|
bin | 1010000000101000111101… |
… | …00100001101110011101101 |
3 | 2212221100101110202221122002 |
4 | 11000110132210031303231 |
5 | 10341122011332432341 |
6 | 114452135132302045 |
7 | 4431221223361454 |
oct | 500243644156355 |
9 | 85840343687562 |
10 | 22012220202221 |
11 | 701736a4a06a7 |
12 | 2576148011925 |
13 | c389884bb3a2 |
14 | 56157ba89b9b |
15 | 2828c5ace29b |
hex | 14051e90dced |
22012220202221 has 2 divisors, whose sum is σ = 22012220202222. Its totient is φ = 22012220202220.
The previous prime is 22012220202199. The next prime is 22012220202227. The reversal of 22012220202221 is 12220202221022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15342340624900 + 6669879577321 = 3916930^2 + 2582611^2 .
It is a cyclic number.
It is not a de Polignac number, because 22012220202221 - 26 = 22012220202157 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22012220202193 and 22012220202202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22012220202227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11006110101110 + 11006110101111.
It is an arithmetic number, because the mean of its divisors is an integer number (11006110101111).
Almost surely, 222012220202221 is an apocalyptic number.
It is an amenable number.
22012220202221 is a deficient number, since it is larger than the sum of its proper divisors (1).
22012220202221 is an equidigital number, since it uses as much as digits as its factorization.
22012220202221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 22012220202221 its reverse (12220202221022), we get a palindrome (34232422423243).
The spelling of 22012220202221 in words is "twenty-two trillion, twelve billion, two hundred twenty million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •