Base | Representation |
---|---|
bin | 1100110100010100010… |
… | …0101110110010001001 |
3 | 210001101021021210021111 |
4 | 3031011010232302021 |
5 | 12101433230401301 |
6 | 245054241210321 |
7 | 21623546550604 |
oct | 3150504566211 |
9 | 701337253244 |
10 | 220202200201 |
11 | 85429446225 |
12 | 368153309a1 |
13 | 179c38716a9 |
14 | a92d19d33b |
15 | 5adbd31551 |
hex | 334512ec89 |
220202200201 has 8 divisors (see below), whose sum is σ = 223516938944. Its totient is φ = 216888289200.
The previous prime is 220202200171. The next prime is 220202200219. The reversal of 220202200201 is 102002202022.
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 220202200201 - 29 = 220202199689 is a prime.
It is a super-2 number, since 2×2202022002012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220202200241) 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, 339916 + ... + 745618.
It is an arithmetic number, because the mean of its divisors is an integer number (27939617368).
Almost surely, 2220202200201 is an apocalyptic number.
It is an amenable number.
220202200201 is a deficient number, since it is larger than the sum of its proper divisors (3314738743).
220202200201 is an equidigital number, since it uses as much as digits as its factorization.
220202200201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413871.
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 220202200201 its reverse (102002202022), we get a palindrome (322204402223).
The spelling of 220202200201 in words is "two hundred twenty billion, two hundred two million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •