Base | Representation |
---|---|
bin | 110010000001101101100101… |
… | …111101001100000100000001 |
3 | 1001212000201002010000120012011 |
4 | 302001231211331030010001 |
5 | 212314301430023224301 |
6 | 2055535443121332521 |
7 | 64225630466333161 |
oct | 6201554575140401 |
9 | 1055021063016164 |
10 | 220020000211201 |
11 | 64117a5a234053 |
12 | 20815424a97141 |
13 | 959ca48cc26c8 |
14 | 3c4904c1c05a1 |
15 | 1a68359bd3a51 |
hex | c81b65f4c101 |
220020000211201 has 16 divisors (see below), whose sum is σ = 220592868623568. Its totient is φ = 219447862272000.
The previous prime is 220020000211159. The next prime is 220020000211213. The reversal of 220020000211201 is 102112000020022.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 7671016515600 + 212348983695601 = 2769660^2 + 14572199^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-220020000211201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220020000211301) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11015861451 + ... + 11015881423.
It is an arithmetic number, because the mean of its divisors is an integer number (13787054288973).
Almost surely, 2220020000211201 is an apocalyptic number.
It is an amenable number.
220020000211201 is a deficient number, since it is larger than the sum of its proper divisors (572868412367).
220020000211201 is a wasteful number, since it uses less digits than its factorization.
220020000211201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36852.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 220020000211201 its reverse (102112000020022), we get a palindrome (322132000231223).
The spelling of 220020000211201 in words is "two hundred twenty trillion, twenty billion, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •