Re: [math-fun] How often does every bit matter?

This provable Sierpinski number 2131043 is (1) prime, (2) "every bit matters" including leading 0s, i.e. if any bit in its binary expression is altered, the result is nonprime. Is it the least such number? It might be possible to prove that by showing that all prime numbers below 2131043 fail to have the "every bit matters including leading zeros" property...