Base | Representation |
---|---|
bin | 110010000001101101101100… |
… | …100100001111000000111001 |
3 | 1001212000201100211200211000112 |
4 | 302001231230210033000321 |
5 | 212314302141421011301 |
6 | 2055535502122314105 |
7 | 64225633314060653 |
oct | 6201555444170071 |
9 | 1055021324624015 |
10 | 220020111110201 |
11 | 6411800689a116 |
12 | 20815456058935 |
13 | 959ca65c8100c |
14 | 3c4905cc0b6d3 |
15 | 1a683647dc9bb |
hex | c81b6c90f039 |
220020111110201 has 4 divisors (see below), whose sum is σ = 220025796570000. Its totient is φ = 220014425650404.
The previous prime is 220020111110153. The next prime is 220020111110263. The reversal of 220020111110201 is 102011111020022.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 220020111110201 - 210 = 220020111109177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220020111110291) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2842671851 + ... + 2842749248.
It is an arithmetic number, because the mean of its divisors is an integer number (55006449142500).
Almost surely, 2220020111110201 is an apocalyptic number.
It is an amenable number.
220020111110201 is a deficient number, since it is larger than the sum of its proper divisors (5685459799).
220020111110201 is an equidigital number, since it uses as much as digits as its factorization.
220020111110201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5685459798.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 220020111110201 its reverse (102011111020022), we get a palindrome (322031222130223).
The spelling of 220020111110201 in words is "two hundred twenty trillion, twenty billion, one hundred eleven million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •