I'm wondering if my work is right here... $$2^{581}x\equiv 1\mod{19}$$
Since $(2,19)=1$, we have $2^{\varphi(19)}\equiv 1\mod{19}\Rightarrow 2^{18}\equiv 1\mod{19}$ by Euler's Theorem.
$2^{581}=(2^{18})^{32}\cdot 2^5\equiv 2^5\mod{19}\Rightarrow 32x\equiv 1\mod{19}\Rightarrow x\equiv 3\mod{19}$ (by Extended Euclidean Algorithm)