Base | Representation |
---|---|
bin | 1010000011100010110110… |
… | …01010111000101011010001 |
3 | 2220021212222202222221122201 |
4 | 11001301123022320223101 |
5 | 10344240404413020144 |
6 | 115010042230403201 |
7 | 4441353333132145 |
oct | 501613312705321 |
9 | 86255882887581 |
10 | 22112021220049 |
11 | 7055723579522 |
12 | 259155b200501 |
13 | c45201a0bba7 |
14 | 566328511225 |
15 | 2852b76111d4 |
hex | 141c5b2b8ad1 |
22112021220049 has 2 divisors, whose sum is σ = 22112021220050. Its totient is φ = 22112021220048.
The previous prime is 22112021220031. The next prime is 22112021220137. The reversal of 22112021220049 is 94002212021122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17010205181649 + 5101816038400 = 4124343^2 + 2258720^2 .
It is a cyclic number.
It is not a de Polignac number, because 22112021220049 - 25 = 22112021220017 is a prime.
It is a super-3 number, since 3×221120212200493 (a number of 41 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 22112021219999 and 22112021220026.
It is not a weakly prime, because it can be changed into another prime (22112021220749) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11056010610024 + 11056010610025.
It is an arithmetic number, because the mean of its divisors is an integer number (11056010610025).
Almost surely, 222112021220049 is an apocalyptic number.
It is an amenable number.
22112021220049 is a deficient number, since it is larger than the sum of its proper divisors (1).
22112021220049 is an equidigital number, since it uses as much as digits as its factorization.
22112021220049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 28.
The spelling of 22112021220049 in words is "twenty-two trillion, one hundred twelve billion, twenty-one million, two hundred twenty thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.220 sec. • engine limits •