Base | Representation |
---|---|
bin | 110010010001011101011110… |
… | …110100010110000101000011 |
3 | 1001222212011110022211021222001 |
4 | 302101131132310112011003 |
5 | 212440014312311223021 |
6 | 2102124542024324431 |
7 | 64400051635501645 |
oct | 6221353664260503 |
9 | 1058764408737861 |
10 | 221102212211011 |
11 | 644a4a1574123a |
12 | 2096b10b613717 |
13 | 964ab06766581 |
14 | 3c85593084895 |
15 | 1a86598c06091 |
hex | c9175ed16143 |
221102212211011 has 2 divisors, whose sum is σ = 221102212211012. Its totient is φ = 221102212211010.
The previous prime is 221102212210993. The next prime is 221102212211081. The reversal of 221102212211011 is 110112212201122.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 221102212211011 - 213 = 221102212202819 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 221102212211011.
It is not a weakly prime, because it can be changed into another prime (221102212211081) 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, 110551106105505 + 110551106105506.
It is an arithmetic number, because the mean of its divisors is an integer number (110551106105506).
Almost surely, 2221102212211011 is an apocalyptic number.
221102212211011 is a deficient number, since it is larger than the sum of its proper divisors (1).
221102212211011 is an equidigital number, since it uses as much as digits as its factorization.
221102212211011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 221102212211011 its reverse (110112212201122), we get a palindrome (331214424412133).
The spelling of 221102212211011 in words is "two hundred twenty-one trillion, one hundred two billion, two hundred twelve million, two hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •