RegExp Q*Bert

I was reading the famous Coding Horror and his comparison between RegExp and Q*Bert languages is very funny and "accurate".

This remains me the post of the new book of RegExp cookbook 2nd ed :

(?:429496729[0-5]|42949672[0-8][0-9]|4294967[01][0-9]{2}|429496[0-6]?[0-9]{3}|42949[0-5][0-9]{4}|4294[0-8][0-9]{5}|429[0-3][0-9]{6}|42[0-8]?[0-9]{7}|4[01][0-9]{8}|3[0-9]{9}|2[2-9][0-9]{8}|21[5-9][0-9]{7}|214[89]?[0-9]{6}|2147[5-9][0-9]{5}|214749[0-9]{4}|214748[4-9][0-9]{3}|2147483?[7-9][0-9]{2}|21474836[5-9][0-9]|214748364[89])

Still I think there must be a better solution for it. Anyone ?