Take b = 2.

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

5413 is prime. b^((n-1)/5413)-1 mod n = 26258, which is a unit, inverse 17683.

(5413) divides n-1.

(5413)^2 > n.

n is prime by Pocklington's theorem.