Base | Representation |
---|---|
bin | 11010010000000… |
… | …00111111010011 |
3 | 120100100120111011 |
4 | 31020000333103 |
5 | 422333030021 |
6 | 33503431351 |
7 | 5312466055 |
oct | 1510007723 |
9 | 510316434 |
10 | 220205011 |
11 | 103333314 |
12 | 618b5557 |
13 | 3680cb30 |
14 | 213618d5 |
15 | 144eade1 |
hex | d200fd3 |
220205011 has 16 divisors (see below), whose sum is σ = 245556864. Its totient is φ = 196176384.
The previous prime is 220204939. The next prime is 220205017. The reversal of 220205011 is 110502022.
It is a cyclic number.
It is not a de Polignac number, because 220205011 - 217 = 220073939 is a prime.
It is a super-3 number, since 3×2202050113 (a number of 26 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220204982 and 220205000.
It is not an unprimeable number, because it can be changed into a prime (220205017) 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 15 ways as a sum of consecutive naturals, for example, 42135 + ... + 47071.
It is an arithmetic number, because the mean of its divisors is an integer number (15347304).
Almost surely, 2220205011 is an apocalyptic number.
220205011 is a deficient number, since it is larger than the sum of its proper divisors (25351853).
220205011 is a wasteful number, since it uses less digits than its factorization.
220205011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5070.
The product of its (nonzero) digits is 40, while the sum is 13.
The square root of 220205011 is about 14839.3062843247. The cubic root of 220205011 is about 603.8685325244.
Adding to 220205011 its reverse (110502022), we get a palindrome (330707033).
The spelling of 220205011 in words is "two hundred twenty million, two hundred five thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •