Base | Representation |
---|---|
bin | 1010000110001110111101… |
… | …01000001001110111101001 |
3 | 2220121201111021112012000201 |
4 | 11003013132220021313221 |
5 | 10402244123240134121 |
6 | 115120323055032201 |
7 | 4451134152363331 |
oct | 503073650116751 |
9 | 86551437465021 |
10 | 22204421021161 |
11 | 7090929886715 |
12 | 25a744780b661 |
13 | c50b38a7a412 |
14 | 56a9b201a0c1 |
15 | 2878c44c4e91 |
hex | 1431dea09de9 |
22204421021161 has 2 divisors, whose sum is σ = 22204421021162. Its totient is φ = 22204421021160.
The previous prime is 22204421021137. The next prime is 22204421021171. The reversal of 22204421021161 is 16112012440222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17579529912025 + 4624891109136 = 4192795^2 + 2150556^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22204421021161 is a prime.
It is not a weakly prime, because it can be changed into another prime (22204421021171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11102210510580 + 11102210510581.
It is an arithmetic number, because the mean of its divisors is an integer number (11102210510581).
Almost surely, 222204421021161 is an apocalyptic number.
It is an amenable number.
22204421021161 is a deficient number, since it is larger than the sum of its proper divisors (1).
22204421021161 is an equidigital number, since it uses as much as digits as its factorization.
22204421021161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3072, while the sum is 28.
Adding to 22204421021161 its reverse (16112012440222), we get a palindrome (38316433461383).
The spelling of 22204421021161 in words is "twenty-two trillion, two hundred four billion, four hundred twenty-one million, twenty-one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •