Base | Representation |
---|---|
bin | 1010000000101000111100… |
… | …00101101100001100011101 |
3 | 2212221100100220201101221201 |
4 | 11000110132011230030131 |
5 | 10341122002310401341 |
6 | 114452134244555501 |
7 | 4431221065353145 |
oct | 500243605541435 |
9 | 85840326641851 |
10 | 22012212200221 |
11 | 7017365a25681 |
12 | 25761453b2b91 |
13 | c38986949089 |
14 | 56157a9a5925 |
15 | 2828c504d331 |
hex | 14051e16c31d |
22012212200221 has 2 divisors, whose sum is σ = 22012212200222. Its totient is φ = 22012212200220.
The previous prime is 22012212200191. The next prime is 22012212200227. The reversal of 22012212200221 is 12200221221022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15873363571321 + 6138848628900 = 3984139^2 + 2477670^2 .
It is a cyclic number.
It is not a de Polignac number, because 22012212200221 - 29 = 22012212199709 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22012212200227) 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, 11006106100110 + 11006106100111.
It is an arithmetic number, because the mean of its divisors is an integer number (11006106100111).
Almost surely, 222012212200221 is an apocalyptic number.
It is an amenable number.
22012212200221 is a deficient number, since it is larger than the sum of its proper divisors (1).
22012212200221 is an equidigital number, since it uses as much as digits as its factorization.
22012212200221 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 22012212200221 its reverse (12200221221022), we get a palindrome (34212433421243).
The spelling of 22012212200221 in words is "twenty-two trillion, twelve billion, two hundred twelve million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •