Base | Representation |
---|---|
bin | 11010010000111… |
… | …00001101101001 |
3 | 120100120020110011 |
4 | 31020130031221 |
5 | 422400112041 |
6 | 33510051521 |
7 | 5313442135 |
oct | 1510341551 |
9 | 510506404 |
10 | 220316521 |
11 | 1033aa077 |
12 | 61949ba1 |
13 | 3684b809 |
14 | 213903c5 |
15 | 1451de81 |
hex | d21c369 |
220316521 has 2 divisors, whose sum is σ = 220316522. Its totient is φ = 220316520.
The previous prime is 220316519. The next prime is 220316539. The reversal of 220316521 is 125613022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 165482496 + 54834025 = 12864^2 + 7405^2 .
It is a cyclic number.
It is not a de Polignac number, because 220316521 - 21 = 220316519 is a prime.
Together with 220316519, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 220316492 and 220316501.
It is not a weakly prime, because it can be changed into another prime (220316581) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110158260 + 110158261.
It is an arithmetic number, because the mean of its divisors is an integer number (110158261).
Almost surely, 2220316521 is an apocalyptic number.
It is an amenable number.
220316521 is a deficient number, since it is larger than the sum of its proper divisors (1).
220316521 is an equidigital number, since it uses as much as digits as its factorization.
220316521 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 220316521 is about 14843.0630598943. The cubic root of 220316521 is about 603.9704466703.
Adding to 220316521 its reverse (125613022), we get a palindrome (345929543).
The spelling of 220316521 in words is "two hundred twenty million, three hundred sixteen thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •