Base | Representation |
---|---|
bin | 11010001111001… |
… | …11011001110101 |
3 | 120100011020201202 |
4 | 31013213121311 |
5 | 422321201323 |
6 | 33501302245 |
7 | 5311551404 |
oct | 1507473165 |
9 | 510136652 |
10 | 220100213 |
11 | 103271603 |
12 | 61864985 |
13 | 367a4218 |
14 | 2133563b |
15 | 144c9d28 |
hex | d1e7675 |
220100213 has 8 divisors (see below), whose sum is σ = 223825536. Its totient is φ = 216392400.
The previous prime is 220100171. The next prime is 220100291. The reversal of 220100213 is 312001022.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 220100213 - 210 = 220099189 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220100194 and 220100203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220100813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22328 + ... + 30638.
It is an arithmetic number, because the mean of its divisors is an integer number (27978192).
Almost surely, 2220100213 is an apocalyptic number.
It is an amenable number.
220100213 is a deficient number, since it is larger than the sum of its proper divisors (3725323).
220100213 is an equidigital number, since it uses as much as digits as its factorization.
220100213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8755.
The product of its (nonzero) digits is 24, while the sum is 11.
The square root of 220100213 is about 14835.7747691181. The cubic root of 220100213 is about 603.7727214193.
Adding to 220100213 its reverse (312001022), we get a palindrome (532101235).
The spelling of 220100213 in words is "two hundred twenty million, one hundred thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •