Ok as some of you know, this number:
has two prime factors and RSA will give $30,000 to the person/team who can find them.
Who here knows some basic number theory on this problem and why it is so hard to factor?
Umm, I will first try Fermat's Factorization Method, find the smallest square exceeding this and keep subtracting this number. (But this is only useful when the two factors are adjacent).
You can also try the Pollard pho primality test. But I am not too familar with it, in fact, I am not familar too well with primality testing.