Base | Representation |
---|---|
bin | 1100110111101010110… |
… | …1111101100100001101 |
3 | 210010200222210120102011 |
4 | 3031322231331210031 |
5 | 12110304130413401 |
6 | 245323431301221 |
7 | 21655055462125 |
oct | 3157255754415 |
9 | 703628716364 |
10 | 221102201101 |
11 | 85850479221 |
12 | 36a2681a811 |
13 | 17b081685c2 |
14 | a9b6919c85 |
15 | 5b40d5d451 |
hex | 337ab7d90d |
221102201101 has 2 divisors, whose sum is σ = 221102201102. Its totient is φ = 221102201100.
The previous prime is 221102201083. The next prime is 221102201141. The reversal of 221102201101 is 101102201122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 201179160900 + 19923040201 = 448530^2 + 141149^2 .
It is a cyclic number.
It is not a de Polignac number, because 221102201101 - 217 = 221102070029 is a prime.
It is a super-2 number, since 2×2211022011012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221102201141) 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, 110551100550 + 110551100551.
It is an arithmetic number, because the mean of its divisors is an integer number (110551100551).
Almost surely, 2221102201101 is an apocalyptic number.
It is an amenable number.
221102201101 is a deficient number, since it is larger than the sum of its proper divisors (1).
221102201101 is an equidigital number, since it uses as much as digits as its factorization.
221102201101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 221102201101 its reverse (101102201122), we get a palindrome (322204402223).
The spelling of 221102201101 in words is "two hundred twenty-one billion, one hundred two million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •