Even though the D-Wave machines can not be labelled as "general purpose", they are certainly research objects with new applications everyday. The capabilities of what they can do is only limited by our current developments, so the term general purpose is rather meaningless in the new QC realm.
Contrary to the previous answer, the latest D-Wave 2X (2000 qbits) can run pretty much any algorithm given that they are converted into a simulated annealing (SA) problem. This paper shows how this is done in practice, while the paper "Prime factorization using quantum annealing and computational algebraic geometry"  show how factorization can be performed (on that machine). It's rather obvious that new technology require a translation from classical algorithms to what is required by the new.
The current limitations are due to the fact that only a fraction of the available qbits can be of utilized for the algorithm. The reason is that you need about ~12 physical qbits for error correction, for every logical qbit needed. So out of the 2000 qbits, you can only use ~166.
So to answer your question, at this moment, no you can't. But when they are able to reach about 2000 logical qbits, then we can use it to factor the lower RSA keys. This is also talked about in this answer.
And from this blog post:
The quantum Fourier transform is applied to a quantum circuit built just out of 1-Qbit and 2-Qbit gates, making the physical implementation of Shor’s algorithm one of the easiest tasks for a quantum computer.
Just one of the steps of Shor’s algorithm needs to be implemented on a quantum computer, while the rest can be done on a classical computer. The quantum subroutine will be performed and fed back to continue the calculation. A quantum computer will likely never be a standalone system, but together with a supercomputer, the time to break an RSA key will be quite reasonable.