Base | Representation |
---|---|
bin | 11010010000001… |
… | …00111100011101 |
3 | 120100101101201020 |
4 | 31020010330131 |
5 | 422334034323 |
6 | 33504034353 |
7 | 5312564232 |
oct | 1510047435 |
9 | 510341636 |
10 | 220221213 |
11 | 103344503 |
12 | 619029b9 |
13 | 36817314 |
14 | 21367789 |
15 | 14500ae3 |
hex | d204f1d |
220221213 has 8 divisors (see below), whose sum is σ = 310900608. Its totient is φ = 138177984.
The previous prime is 220221193. The next prime is 220221223. The reversal of 220221213 is 312122022.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220221213 - 25 = 220221181 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 220221192 and 220221201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220221223) 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 in 7 ways as a sum of consecutive naturals, for example, 2158981 + ... + 2159082.
It is an arithmetic number, because the mean of its divisors is an integer number (38862576).
Almost surely, 2220221213 is an apocalyptic number.
It is an amenable number.
220221213 is a deficient number, since it is larger than the sum of its proper divisors (90679395).
220221213 is a wasteful number, since it uses less digits than its factorization.
220221213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4318083.
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 220221213 is about 14839.8521892908. The cubic root of 220221213 is about 603.8833424175.
Adding to 220221213 its reverse (312122022), we get a palindrome (532343235).
The spelling of 220221213 in words is "two hundred twenty million, two hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •