Primality proof for n = 442963:
Take b = 2.
b^(n-1) mod n = 1.
631 is prime.
b^((n-1)/631)-1 mod n = 143097, which is a unit, inverse 135591.
13 is prime.
b^((n-1)/13)-1 mod n = 10372, which is a unit, inverse 247405.
(13 * 631) divides n-1.
(13 * 631)^2 > n.
n is prime by Pocklington's theorem.