Primality proof for n = 272333:

Take b = 2.

b^(n-1) mod n = 1.

661 is prime.
b^((n-1)/661)-1 mod n = 150860, which is a unit, inverse 194137.

(661) divides n-1.

(661)^2 > n.

n is prime by Pocklington's theorem.