Base | Representation |
---|---|
bin | 1010000000111011100010… |
… | …11110000001001100100101 |
3 | 2212222022011001110002101001 |
4 | 11000131301132001030211 |
5 | 10341302431430134341 |
6 | 114500505352033301 |
7 | 4432023446055232 |
oct | 500356136011445 |
9 | 85868131402331 |
10 | 22022201021221 |
11 | 70206213a4745 |
12 | 2578072692831 |
13 | c398b922114b |
14 | 561c47458789 |
15 | 282cabe4dd31 |
hex | 140771781325 |
22022201021221 has 2 divisors, whose sum is σ = 22022201021222. Its totient is φ = 22022201021220.
The previous prime is 22022201021129. The next prime is 22022201021263. The reversal of 22022201021221 is 12212010222022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 14194734408100 + 7827466613121 = 3767590^2 + 2797761^2 .
It is a cyclic number.
It is not a de Polignac number, because 22022201021221 - 29 = 22022201020709 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22022261021221) 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, 11011100510610 + 11011100510611.
It is an arithmetic number, because the mean of its divisors is an integer number (11011100510611).
Almost surely, 222022201021221 is an apocalyptic number.
It is an amenable number.
22022201021221 is a deficient number, since it is larger than the sum of its proper divisors (1).
22022201021221 is an equidigital number, since it uses as much as digits as its factorization.
22022201021221 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 22022201021221 its reverse (12212010222022), we get a palindrome (34234211243243).
The spelling of 22022201021221 in words is "twenty-two trillion, twenty-two billion, two hundred one million, twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •