Base | Representation |
---|---|
bin | 110010001111111111010100… |
… | …101101111010000111101001 |
3 | 1001222111111111102002122122102 |
4 | 302033333110231322013221 |
5 | 212431340233410120014 |
6 | 2102010301523103145 |
7 | 64356542360530025 |
oct | 6217772455720751 |
9 | 1058444442078572 |
10 | 221001111020009 |
11 | 64466054758031 |
12 | 209535b4b11ab5 |
13 | 9641413a7a028 |
14 | 3c80721a95385 |
15 | 1a83b2ce9c8de |
hex | c8ffd4b7a1e9 |
221001111020009 has 2 divisors, whose sum is σ = 221001111020010. Its totient is φ = 221001111020008.
The previous prime is 221001111019987. The next prime is 221001111020077. The reversal of 221001111020009 is 900020111100122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 165076962739984 + 55924148280025 = 12848228^2 + 7478245^2 .
It is a cyclic number.
It is not a de Polignac number, because 221001111020009 - 212 = 221001111015913 is a prime.
It is a super-3 number, since 3×2210011110200093 (a number of 44 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (221001111020309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110500555510004 + 110500555510005.
It is an arithmetic number, because the mean of its divisors is an integer number (110500555510005).
Almost surely, 2221001111020009 is an apocalyptic number.
It is an amenable number.
221001111020009 is a deficient number, since it is larger than the sum of its proper divisors (1).
221001111020009 is an equidigital number, since it uses as much as digits as its factorization.
221001111020009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 221001111020009 in words is "two hundred twenty-one trillion, one billion, one hundred eleven million, twenty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •