Base | Representation |
---|---|
bin | 1010000000100110101011… |
… | …11001010101010100000101 |
3 | 2212221020020111122010021111 |
4 | 11000103111321111110011 |
5 | 10341112012224014341 |
6 | 114451414140445021 |
7 | 4431146060342551 |
oct | 500232571252405 |
9 | 85836214563244 |
10 | 22011001001221 |
11 | 70168a426a971 |
12 | 2575a67849771 |
13 | c38822a3338b |
14 | 5614a3b9c861 |
15 | 282853a4e681 |
hex | 1404d5e55505 |
22011001001221 has 2 divisors, whose sum is σ = 22011001001222. Its totient is φ = 22011001001220.
The previous prime is 22011001001131. The next prime is 22011001001293. The reversal of 22011001001221 is 12210010011022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 20110614684196 + 1900386317025 = 4484486^2 + 1378545^2 .
It is a cyclic number.
It is not a de Polignac number, because 22011001001221 - 211 = 22011000999173 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22011001061221) 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, 11005500500610 + 11005500500611.
It is an arithmetic number, because the mean of its divisors is an integer number (11005500500611).
Almost surely, 222011001001221 is an apocalyptic number.
It is an amenable number.
22011001001221 is a deficient number, since it is larger than the sum of its proper divisors (1).
22011001001221 is an equidigital number, since it uses as much as digits as its factorization.
22011001001221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 22011001001221 its reverse (12210010011022), we get a palindrome (34221011012243).
The spelling of 22011001001221 in words is "twenty-two trillion, eleven billion, one million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •