Quote:
Originally Posted by Dr Sardonicus
It is intuitively obvious that, if k is "sufficiently large", the smallest "2brilliant" number n > 2^{2k} is n = p_{1}*p_{2}, where p_{1} = nextprime(2^{k}) and p_{2} = nextprime(p_{1} + 1). Numerical evidence suggests that "sufficiently large" is k > 3. This notion "obviously" applies to any base.

Dr Sardonicus,
does this statement apply to largest 2brilliant numbers in base 10?
If yes, please give an example.