The RSA encryption algorithm is based on the fact that it is hard to factor a large number (250+ digits). If you were able to factor a large number quickly how would you be able to find the encryption ( e ) and decryption key (d) easily.
Test your theory on the n = 77 (*11)