Base | Representation |
---|---|
bin | 110010000100101000111001… |
… | …101000101110000110011001 |
3 | 1001212201221012111121001101221 |
4 | 302010220321220232012121 |
5 | 212331100323222023001 |
6 | 2100212104055012041 |
7 | 64246310436304162 |
oct | 6204507150560631 |
9 | 1055657174531357 |
10 | 220221120111001 |
11 | 64195286171579 |
12 | 208483b366a021 |
13 | 95b59bb33c189 |
14 | 3c54a8ad00769 |
15 | 1a6d6cb6201a1 |
hex | c84a39a2e199 |
220221120111001 has 2 divisors, whose sum is σ = 220221120111002. Its totient is φ = 220221120111000.
The previous prime is 220221120110993. The next prime is 220221120111053. The reversal of 220221120111001 is 100111021122022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 157324340410000 + 62896779701001 = 12542900^2 + 7930749^2 .
It is a cyclic number.
It is not a de Polignac number, because 220221120111001 - 23 = 220221120110993 is a prime.
It is a super-2 number, since 2×2202211201110012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (220221120111901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110110560055500 + 110110560055501.
It is an arithmetic number, because the mean of its divisors is an integer number (110110560055501).
Almost surely, 2220221120111001 is an apocalyptic number.
It is an amenable number.
220221120111001 is a deficient number, since it is larger than the sum of its proper divisors (1).
220221120111001 is an equidigital number, since it uses as much as digits as its factorization.
220221120111001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 220221120111001 its reverse (100111021122022), we get a palindrome (320332141233023).
The spelling of 220221120111001 in words is "two hundred twenty trillion, two hundred twenty-one billion, one hundred twenty million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •