41

This article is about a particular natural number.|View all articles on particular natural numbers

Summary

Factorization

The number 41 is a prime number.

Properties and families

Property or family	Parameter values	First few numbers	Proof of satisfaction/membership/containment
prime number	it is the 13th prime number	2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, [SHOW MORE] 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271 View list on OEIS	A natural number $n>1$ is prime if and only if $n$ is not divisible by any prime less than or equal to $\sqrt{n}$. Since $\sqrt{41}$ is between 6 and 7, we only need to check divisibility by primes less than or equal to 6, i.e., we need to verify that 41 is not divisible by the primes 2, 3, and 5.
regular prime	first regular prime occurring after an irregular prime	3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 41, 43, 47, 53, 61, [SHOW MORE] 71, 73, 79, 83, 89, 97, 107, 109, 113, 127, 137, 139, 151, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 239, 241, 251, 269, 277, 281, 313, 317, 331, 337, 349, 359, 367, 373, 383, 397, 419, 431 View list on OEIS
lucky number of Euler	biggest of six such numbers	2, 3, 5, 11, 17, 41 View list on OEIS	A prime $p$ is a lucky number of Euler iff the ring of integers in $\mathbb{Q}(\sqrt{1-4p})$ is a unique factorization domain.
Proth prime: prime of the form $k\cdot 2^n+1$ with $2^n>k$	$n=3,k=5$	3, 5, 13, 17, 41, 97, 113, [SHOW MORE] 193, 241, 257, 353, 449, 577, 641, 673, 769, 929, 1153, 1217, 1409, 1601, 2113, 2689, 2753, 3137, 3329, 3457, 4481, 4993, 6529, 7297, 7681, 7937, 9473, 9601, 9857, 10369, 10753, 11393, 11777, 12161, 12289, 13313 View list on OEIS

Waring representations

Sums of squares

Item	Value
unique (up to plus/minus and ordering) representation as sum of two squares	$5^2+4^2$. Note that existence and uniqueness both follow from it being a prime that is 1 mod 4. This also corresponds to the factorization $17=(5+4i)(5-4i)$ in the ring of Gaussian integers $\mathbb{Z}[i]$.
representations as sum of three squares (up to ordering and plus/minus equivalence)	$5^2+4^2+0^2$ $4^2+4^2+3^2$ $6^2+2^2+1^2$

Prime-generating polynomials

Below are some polynomials that give prime numbers for small input values, which give the value 41 for suitable input choice.

Polynomial	Degree	Some values for which it generates primes	Input value $n$ at which it generates 41
$n^2-n+11$	2	all numbers 1-10, because 11 is one of the lucky numbers of Euler.	6
$n^2-n+41$	2	all numbers 1-40, because 41 is one of the lucky numbers of Euler.	1