I was rewatching an MIT lecture on RSA and encryptions and fell down the rabbit holes of prime numbers. The RSA challenge's for solving the factors of a semiprime ended back in 2007, that's too bad as there are still a number of semiprimes left to be solved. I spent the better part of a day looking up the various proven theorems and some unproven conjectures dealing with primes. I think I'm going to setup a couple machines and dedicate them at cracking the RSA-232 semiprime. As the name suggests, it is a 232 digit integer! It is such a large number it is hard for a human to comprehend the size of it. Below is the semiprime: 

RSA-232=1009881397871923546909564894309468582818233821955573955141120516205831021338528545374366109757154363664913380084917065169921701524733294389270280234380960909804976440540711201965410747553824948672771374075011577182305398340606162079
What is funny about this challenge is that finding a factor of the semiprime is a colossal effort. Proving it is a simple multiplication.