Base | Representation |
---|---|
bin | 1010000100011010101101… |
… | …01100111011111010110101 |
3 | 2220101202101211010012120211 |
4 | 11002031112230323322311 |
5 | 10400233314310444341 |
6 | 115031522140225421 |
7 | 4443464450254024 |
oct | 502152654737265 |
9 | 86352354105524 |
10 | 22142011031221 |
11 | 7067412a93534 |
12 | 259732a83b271 |
13 | c47ca0c474a3 |
14 | 5679714668bb |
15 | 285e703c6181 |
hex | 142356b3beb5 |
22142011031221 has 2 divisors, whose sum is σ = 22142011031222. Its totient is φ = 22142011031220.
The previous prime is 22142011031207. The next prime is 22142011031233. The reversal of 22142011031221 is 12213011024122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 16733711950596 + 5408299080625 = 4090686^2 + 2325575^2 .
It is a cyclic number.
It is not a de Polignac number, because 22142011031221 - 29 = 22142011030709 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22142011031192 and 22142011031201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22142011031291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11071005515610 + 11071005515611.
It is an arithmetic number, because the mean of its divisors is an integer number (11071005515611).
Almost surely, 222142011031221 is an apocalyptic number.
It is an amenable number.
22142011031221 is a deficient number, since it is larger than the sum of its proper divisors (1).
22142011031221 is an equidigital number, since it uses as much as digits as its factorization.
22142011031221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 22142011031221 its reverse (12213011024122), we get a palindrome (34355022055343).
The spelling of 22142011031221 in words is "twenty-two trillion, one hundred forty-two billion, eleven million, thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •