Primality proof for n = 44774420161:
Take b = 2.
b^(n-1) mod n = 1.
2969 is prime.
b^((n-1)/2969)-1 mod n = 32219964998, which is a unit, inverse 23440097309.
683 is prime.
b^((n-1)/683)-1 mod n = 41314723143, which is a unit, inverse 25322941652.
(683 * 2969) divides n-1.
(683 * 2969)^2 > n.
n is prime by Pocklington's theorem.