Solve the Problem $\mathrm { n } ^ { 2 } - \mathrm { n } + 41$

Solve the problem.
-Euler conjectured that the formula $\mathrm { n } ^ { 2 } - \mathrm { n } + 41$ would generate prime numbers for whole numbers $\mathrm { n }$ . The formula generates prime numbers for $\mathrm { n }$ up to 40 and fails at $\mathrm { n } = 41$ .
Evaluate Euler's formula for $n = 42$ and determine whether this is a prime number. If it is not a prime number, give its prime factors.