Base | Representation |
---|---|
bin | 110010010000010010001001… |
… | …011000101011111011100101 |
3 | 1001222120102122221121220222111 |
4 | 302100102021120223323211 |
5 | 212432203131413032044 |
6 | 2102023443230401021 |
7 | 64361156254201144 |
oct | 6220221130537345 |
9 | 1058512587556874 |
10 | 221021322002149 |
11 | 64473686290059 |
12 | 209574b5660171 |
13 | 96432b5085866 |
14 | 3c816bbdbb75b |
15 | 1a844124e1b34 |
hex | c9048962bee5 |
221021322002149 has 2 divisors, whose sum is σ = 221021322002150. Its totient is φ = 221021322002148.
The previous prime is 221021322002141. The next prime is 221021322002153. The reversal of 221021322002149 is 941200223120122.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 216600184979649 + 4421137022500 = 14717343^2 + 2102650^2 .
It is a cyclic number.
It is not a de Polignac number, because 221021322002149 - 23 = 221021322002141 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 221021322002149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221021322002141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110510661001074 + 110510661001075.
It is an arithmetic number, because the mean of its divisors is an integer number (110510661001075).
Almost surely, 2221021322002149 is an apocalyptic number.
It is an amenable number.
221021322002149 is a deficient number, since it is larger than the sum of its proper divisors (1).
221021322002149 is an equidigital number, since it uses as much as digits as its factorization.
221021322002149 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6912, while the sum is 31.
The spelling of 221021322002149 in words is "two hundred twenty-one trillion, twenty-one billion, three hundred twenty-two million, two thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •