Base | Representation |
---|---|
bin | 10100100000100001… |
… | …001111001001111101 |
3 | 2002211122022020202022 |
4 | 110200201033021331 |
5 | 330044211421341 |
6 | 14041022005525 |
7 | 1406454324602 |
oct | 244041171175 |
9 | 62748266668 |
10 | 22020420221 |
11 | 937aa536a8 |
12 | 43267168a5 |
13 | 20cc151767 |
14 | 10cc7786a9 |
15 | 88d313e4b |
hex | 52084f27d |
22020420221 has 2 divisors, whose sum is σ = 22020420222. Its totient is φ = 22020420220.
The previous prime is 22020420209. The next prime is 22020420223. The reversal of 22020420221 is 12202402022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12185731321 + 9834688900 = 110389^2 + 99170^2 .
It is a cyclic number.
It is not a de Polignac number, because 22020420221 - 218 = 22020158077 is a prime.
It is a Sophie Germain prime.
Together with 22020420223, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 22020420221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22020420223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11010210110 + 11010210111.
It is an arithmetic number, because the mean of its divisors is an integer number (11010210111).
Almost surely, 222020420221 is an apocalyptic number.
It is an amenable number.
22020420221 is a deficient number, since it is larger than the sum of its proper divisors (1).
22020420221 is an equidigital number, since it uses as much as digits as its factorization.
22020420221 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 17.
Adding to 22020420221 its reverse (12202402022), we get a palindrome (34222822243).
The spelling of 22020420221 in words is "twenty-two billion, twenty million, four hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •