Base | Representation |
---|---|
bin | 110010010100100000000010… |
… | …110001011100001010000011 |
3 | 1002000121010200120012210010212 |
4 | 302110200002301130022003 |
5 | 213001430134030434412 |
6 | 2102404531532144335 |
7 | 64421125620021005 |
oct | 6224400261341203 |
9 | 1060533616183125 |
10 | 221311121343107 |
11 | 6457557947a224 |
12 | 209a36b29080ab |
13 | 966471a76ba33 |
14 | 3c91730486375 |
15 | 1a8bc243a8222 |
hex | c94802c5c283 |
221311121343107 has 2 divisors, whose sum is σ = 221311121343108. Its totient is φ = 221311121343106.
The previous prime is 221311121343073. The next prime is 221311121343133. The reversal of 221311121343107 is 701343121113122.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221311121343107 is a prime.
It is a super-2 number, since 2×2213111213431072 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (221311121343197) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110655560671553 + 110655560671554.
It is an arithmetic number, because the mean of its divisors is an integer number (110655560671554).
Almost surely, 2221311121343107 is an apocalyptic number.
221311121343107 is a deficient number, since it is larger than the sum of its proper divisors (1).
221311121343107 is an equidigital number, since it uses as much as digits as its factorization.
221311121343107 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6048, while the sum is 32.
Adding to 221311121343107 its reverse (701343121113122), we get a palindrome (922654242456229).
The spelling of 221311121343107 in words is "two hundred twenty-one trillion, three hundred eleven billion, one hundred twenty-one million, three hundred forty-three thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •