Base | Representation |
---|---|
bin | 1100110100011000110… |
… | …1010101010001001111 |
3 | 210001102121002201021121 |
4 | 3031012031111101033 |
5 | 12102003113412312 |
6 | 245100201141411 |
7 | 21624200405524 |
oct | 3150615252117 |
9 | 701377081247 |
10 | 220221232207 |
11 | 85439165259 |
12 | 3681b78a867 |
13 | 179c77a6332 |
14 | a93191514b |
15 | 5add840707 |
hex | 334635544f |
220221232207 has 2 divisors, whose sum is σ = 220221232208. Its totient is φ = 220221232206.
The previous prime is 220221232201. The next prime is 220221232241. The reversal of 220221232207 is 702232122022.
220221232207 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 220221232207 - 231 = 218073748559 is a prime.
It is a super-2 number, since 2×2202212322072 (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 (220221232201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110110616103 + 110110616104.
It is an arithmetic number, because the mean of its divisors is an integer number (110110616104).
Almost surely, 2220221232207 is an apocalyptic number.
220221232207 is a deficient number, since it is larger than the sum of its proper divisors (1).
220221232207 is an equidigital number, since it uses as much as digits as its factorization.
220221232207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2688, while the sum is 25.
Adding to 220221232207 its reverse (702232122022), we get a palindrome (922453354229).
The spelling of 220221232207 in words is "two hundred twenty billion, two hundred twenty-one million, two hundred thirty-two thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •