Base | Representation |
---|---|
bin | 110010010011001011010010… |
… | …001101001100011110001101 |
3 | 1002000021102202222111102020011 |
4 | 302103023102031030132031 |
5 | 212443432242212101333 |
6 | 2102255041102553221 |
7 | 64411424415164455 |
oct | 6223132215143615 |
9 | 1060242688442204 |
10 | 221220112222093 |
11 | 6453aa17175626 |
12 | 20989b33b98811 |
13 | 9658c75867b3a |
14 | 3c8b179544d65 |
15 | 1a896996479cd |
hex | c932d234c78d |
221220112222093 has 2 divisors, whose sum is σ = 221220112222094. Its totient is φ = 221220112222092.
The previous prime is 221220112222069. The next prime is 221220112222127. The reversal of 221220112222093 is 390222211022122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 195624476042724 + 25595636179369 = 13986582^2 + 5059213^2 .
It is a cyclic number.
It is not a de Polignac number, because 221220112222093 - 221 = 221220110124941 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221220112222063) 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, 110610056111046 + 110610056111047.
It is an arithmetic number, because the mean of its divisors is an integer number (110610056111047).
Almost surely, 2221220112222093 is an apocalyptic number.
It is an amenable number.
221220112222093 is a deficient number, since it is larger than the sum of its proper divisors (1).
221220112222093 is an equidigital number, since it uses as much as digits as its factorization.
221220112222093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 31.
The spelling of 221220112222093 in words is "two hundred twenty-one trillion, two hundred twenty billion, one hundred twelve million, two hundred twenty-two thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •