Base | Representation |
---|---|
bin | 1100110011100110111… |
… | …1100100001001001001 |
3 | 210000220000120210212102 |
4 | 3030321233210021021 |
5 | 12101041044232332 |
6 | 245023330523145 |
7 | 21616051004225 |
oct | 3147157441111 |
9 | 700800523772 |
10 | 220012102217 |
11 | 85341106856 |
12 | 367817364b5 |
13 | 1799337348b |
14 | a911c37785 |
15 | 5aca2d1062 |
hex | 3339be4249 |
220012102217 has 2 divisors, whose sum is σ = 220012102218. Its totient is φ = 220012102216.
The previous prime is 220012102187. The next prime is 220012102229. The reversal of 220012102217 is 712201210022.
220012102217 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 212627965456 + 7384136761 = 461116^2 + 85931^2 .
It is a cyclic number.
It is not a de Polignac number, because 220012102217 - 212 = 220012098121 is a prime.
It is not a weakly prime, because it can be changed into another prime (220012102267) 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, 110006051108 + 110006051109.
It is an arithmetic number, because the mean of its divisors is an integer number (110006051109).
Almost surely, 2220012102217 is an apocalyptic number.
It is an amenable number.
220012102217 is a deficient number, since it is larger than the sum of its proper divisors (1).
220012102217 is an equidigital number, since it uses as much as digits as its factorization.
220012102217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 20.
Adding to 220012102217 its reverse (712201210022), we get a palindrome (932213312239).
The spelling of 220012102217 in words is "two hundred twenty billion, twelve million, one hundred two thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •