It's going to be like that for a while, even after we're well into the quantum supremacy realm. First, there's not anything you can do with a real machine until error correction is working, which requires 10k(?) qubits. And frankly, there isn't a whole lot you could do with even a real million qbit machine now if one were to exist. Prime factorization is the big one, but other NP complete problems have no known quantum algorithm to speed them up (and note prime factorization is not NP complete -- so it's possible no quantum speedup for any NP complete problem exists (or it's possible that P==NP in which case....)). The real work is in the math and algo theory to find solutions for these problems. Coding and running them is actually kind of incidental and "cute".
Still, it would be an extremely exciting discovery for physics if it turned out that a QC is not physically realizable. It would prove that quantum mechanics is not the final description of the world, and it would likely be a huge step forward for understanding the measurement problem.
Aside from being able to break the majority of asymmetric encryption schemes, in particular RSA as you mention with prime factoring.
There's one other really good reason: it's fun!
We're also working with larger devices, but I'm not sure if I'm supposed to comment on those right now :)
I learned Golang like 1.5 years ago, and it totally changed how I think about concurrency. I think about interacting processes way different now, as a result - and I was kinda hoping the same thing would happen with ~quantum~. Blarg.
At some point in the future certain quantum algorithms will become 'callable' from traditional programming languages, and will be usable by any competent programmer without much hassle. But making the quantum algorithms themselves is quite a different ballgame altogether, very much unlike traditional programming.