Note that this is actually the binary representation of this number; in base 10 this number is approximately 0.77: https://en.m.wikipedia.org/wiki/Liouville_number#The_existen.... Also note that the “ellipses” in this case are not at all obvious; stating that this is the factorial sequence or adding more terms would make this much clearer.
Normally, a long run of exact matching text in X along with access to Y is sufficient to easily proof beyond a reasonable doubt such copying from Y, which is good enough to prove any kind of copyright violation, whether criminal or civil.
Chapernowne's number and other normal numbers  are among the rare cases where similarity plus access would not be sufficient to prove copying.
Now, if you combined a normal number with some kind of instructions to find and extract, say, the part that exactly matches the first Harry Potter novel, then you would probably have a copyright violation, but it would be the instructions that infringed, not the normal number itself.
BTW, those instructions would take up about as much space as the Harry Potter novel they tell you how to find. The offset to a given long meaningful string S in a normal number is essentially a random number about the same length as S. Sometimes people like to imagine using normal number offsets as a form of data compression, albeit not a practical one, but the offsets are big enough to spoil that.
 A "normal" number in base b is a number whose base b expansion contains every sequence of k base b digits with density 1/b^k.
It’s truly the worst number!
Also the second part of your comment isn't making sense, it has been shown for Champernowne's constant so how can you say it hasn't been shown for any individually?
According to Wikipedia, no irrational algebraic number has been shown to be normal (normal is a slightly stronger condition; see last paragraph in https://en.wikipedia.org/wiki/Normal_number#Properties_and_e...).
This time, here's a video that explains from the basics what kinds of numbers exist:
It is known that at least one of e + pi and e pi is irrational, though. That's because e and pi are both transcendental, and so the polynomial (x-pi)(x-e) = x^2 - (e+pi)x + e pi cannot have all rational coefficients. If it did, e and pi would be roots of a polynomial with rational coefficients, and therefore not transcendental.
He's also keeping the 90s style alive with his whimsical Reality Carnival.
However, we can have alternative, more powerful formal systems that are able to capture well-known transcendental numbers in a finite amount of notation. The most powerful class of such systems are Turing-complete systems. However, even such systems won't capture all transcendentals, since there exists a subset of transcendentals called uncomputable numbers. Uncomputable numbers outnumber computable ones.
More powerful formalisms also have the downsides that they lose some "nice" properties such as ability to always prove equality of two numbers, as they gain power. Algebraic numbers and especially rational numbers are super nice and well-behaved in comparison.
We start with the integers that, for the purposes of this comment, I will take to be god given. However, the integers are "missing" numbers in the sense that division of integers does not always give integers. For instance, the integers have 4/2 and 6/2, but are missing 5/2.
To accommodate this, we can invent the rational numbers, which extends the integers to provide closure under division .
As it turns out, the rationals are still missing numbers. For instance, there is no rational number that satisfies x^2 - 2 = 0, even though rational numbers can get arbitrarily close. To solve this, we introduced the algebraic numbers, which are the closure of the rational numbers under polynomial roots .
As it turns out, perhaps suprisingly, the algebraic numbers are still missing sum. For instance, the limit of the (1 + 1/n)^n as n -> infinity cannot be expressed as the root of a polynomial with rational coefficients. We define "transcendental" as the set of all numbers which are not algebraic.
You could easily define a base-e numbering system, which could, in principle, be useful for... something. A major downside is that you lose the ability to express most integers in a finite amount of digits, and doing arithmatic becomes highly non-trivial. Eg, we would have 1 + 2 = 10.0100112... (assuming I didn't make any mistake). It would probably be simpler to keep working in base-10, and instead explicitly talk about the coeficients of the infinite sum k_i * e^i
 Excluding division by 0. We could define something like the rationals such that this is defined. Actually we have and they are called wheels, but it generally creates more headaches than it solves.
 Eg, it contains all the roots of polynomials with rational coefficients. Technically speaking, the definition should say that it also contains the roots of all polynomials with algebraic coeficients, but it turns out we get this for free for having all the roots of polynomials with rational coefficients.
Most mathematicians are not concerned with which base the number system is in and are not really restricted in working in base 10. So in some sense almost all mathematicians don't really "use" decimal. In that regard, there are many possible interpretations to your question so probably many possible answers.
In other words, choosing to use base 10 instead of base 2 or 3 is like choosing to use python for your project because its easy, familiar and gets the job done rather than choosing a specialty language that would be "better" but harder to use.
This is incorrect. There is no last ant in an infinite line of ants, just as there’s no last digit of pi.