Base | Representation |
---|---|
bin | 110010000100101000111111… |
… | …000000011101100111010011 |
3 | 1001212201221102210011010002201 |
4 | 302010220333000131213103 |
5 | 212331101014304033021 |
6 | 2100212121034224031 |
7 | 64246312612235446 |
oct | 6204507700354723 |
9 | 1055657383133081 |
10 | 220221210221011 |
11 | 6419532201855a |
12 | 20848419885017 |
13 | 95b5a03bcc1cc |
14 | 3c54a98c7965d |
15 | 1a6d6d44be591 |
hex | c84a3f01d9d3 |
220221210221011 has 2 divisors, whose sum is σ = 220221210221012. Its totient is φ = 220221210221010.
The previous prime is 220221210220997. The next prime is 220221210221017. The reversal of 220221210221011 is 110122012122022.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 220221210221011 - 27 = 220221210220883 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220221210221011.
It is not a weakly prime, because it can be changed into another prime (220221210221017) 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, 110110605110505 + 110110605110506.
It is an arithmetic number, because the mean of its divisors is an integer number (110110605110506).
Almost surely, 2220221210221011 is an apocalyptic number.
220221210221011 is a deficient number, since it is larger than the sum of its proper divisors (1).
220221210221011 is an equidigital number, since it uses as much as digits as its factorization.
220221210221011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 220221210221011 its reverse (110122012122022), we get a palindrome (330343222343033).
The spelling of 220221210221011 in words is "two hundred twenty trillion, two hundred twenty-one billion, two hundred ten million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •