Base | Representation |
---|---|
bin | 1100110011111110010… |
… | …1110100100010000001 |
3 | 210001010212012021002111 |
4 | 3030333211310202001 |
5 | 12101241203224301 |
6 | 245041153415321 |
7 | 21621351632236 |
oct | 3147745644201 |
9 | 701125167074 |
10 | 220110211201 |
11 | 85391526561 |
12 | 367aa56a541 |
13 | 179aa7a432a |
14 | a920c9578d |
15 | 5ad3c10551 |
hex | 333f974881 |
220110211201 has 8 divisors (see below), whose sum is σ = 224902154880. Its totient is φ = 215322798768.
The previous prime is 220110211193. The next prime is 220110211213. The reversal of 220110211201 is 102112011022.
220110211201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 220110211201 - 23 = 220110211193 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220110211261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1034511 + ... + 1228996.
It is an arithmetic number, because the mean of its divisors is an integer number (28112769360).
Almost surely, 2220110211201 is an apocalyptic number.
It is an amenable number.
220110211201 is a deficient number, since it is larger than the sum of its proper divisors (4791943679).
220110211201 is a wasteful number, since it uses less digits than its factorization.
220110211201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2265623.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 220110211201 its reverse (102112011022), we get a palindrome (322222222223).
The spelling of 220110211201 in words is "two hundred twenty billion, one hundred ten million, two hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •