Base | Representation |
---|---|
bin | 110010000011000001100110… |
… | …010110101001110110001011 |
3 | 1001212100022220101002120010111 |
4 | 302003001212112221312023 |
5 | 212322241143001400021 |
6 | 2100045121441455151 |
7 | 64235302656153013 |
oct | 6203014626516613 |
9 | 1055308811076114 |
10 | 220110201200011 |
11 | 64152237352aa1 |
12 | 2082a9b90414b7 |
13 | 95a83c2657075 |
14 | 3c4d567a7ac43 |
15 | 1a6a888a128e1 |
hex | c830665a9d8b |
220110201200011 has 4 divisors (see below), whose sum is σ = 224793396970272. Its totient is φ = 215427005429752.
The previous prime is 220110201199991. The next prime is 220110201200017. The reversal of 220110201200011 is 110002102011022.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 220110201200011 - 25 = 220110201199979 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 220110201199964 and 220110201200000.
It is not an unprimeable number, because it can be changed into a prime (220110201200017) 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, 2341597885060 + ... + 2341597885153.
It is an arithmetic number, because the mean of its divisors is an integer number (56198349242568).
Almost surely, 2220110201200011 is an apocalyptic number.
220110201200011 is a deficient number, since it is larger than the sum of its proper divisors (4683195770261).
220110201200011 is an equidigital number, since it uses as much as digits as its factorization.
220110201200011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4683195770260.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 220110201200011 its reverse (110002102011022), we get a palindrome (330112303211033).
The spelling of 220110201200011 in words is "two hundred twenty trillion, one hundred ten billion, two hundred one million, two hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •