Base | Representation |
---|---|
bin | 1100110011101001000… |
… | …1111101110011011101 |
3 | 210000220122112222020120 |
4 | 3030322101331303131 |
5 | 12101100401321341 |
6 | 245024252105153 |
7 | 21616220443620 |
oct | 3147221756335 |
9 | 700818488216 |
10 | 220021120221 |
11 | 85346206151 |
12 | 367847651b9 |
13 | 179951b0086 |
14 | a913103db7 |
15 | 5acaeb3066 |
hex | 333a47dcdd |
220021120221 has 64 divisors (see below), whose sum is σ = 365621329920. Its totient is φ = 114849031680.
The previous prime is 220021120219. The next prime is 220021120247. The reversal of 220021120221 is 122021120022.
It is not a de Polignac number, because 220021120221 - 21 = 220021120219 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220021120221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220021160221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3394105 + ... + 3458321.
It is an arithmetic number, because the mean of its divisors is an integer number (5712833280).
Almost surely, 2220021120221 is an apocalyptic number.
220021120221 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
220021120221 is a deficient number, since it is larger than the sum of its proper divisors (145600209699).
220021120221 is a wasteful number, since it uses less digits than its factorization.
220021120221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64554.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 220021120221 its reverse (122021120022), we get a palindrome (342042240243).
The spelling of 220021120221 in words is "two hundred twenty billion, twenty-one million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •