Titanic Prime whose Digits are all 9 except for one 1

Theorem
The integer defined as:


 * $2 \times 10^{3020} - 1$

is a titanic prime all of whose digits are $9$ except one, which is $1$.

That is:
 * $1 \left({9}\right)_{3020}$

where $\left({a}\right)_b$ means $b$ instances of $a$ in a string.

Proof
It is clear that the digits are instances of $9$ except for the first $1$.

It is also noted that it has $3020 + 1 = 3021$ digits, making it titanic.