PNG images: 5

5 (five) is a number, numeral and digit. It is the natural number following 4 and preceding 6, and is a prime number. It has attained significance throughout history in part because typical humans have five digits on each hand.

Five is the third smallest prime number. Since it can be written as 221 + 1, five is classified as a Fermat prime; therefore, a regular polygon with 5 sides (a regular pentagon) is constructible with compass and an unmarked straightedge. Five is the third Sophie Germain prime, the first safe prime, the third Catalan number, and the third Mersenne prime exponent. Five is the first Wilson prime and the third factorial prime, also an alternating factorial. Five is the first good prime. It is an Eisenstein prime with no imaginary part and real part of the form 3n − 1. It is also the only number that is part of more than one pair of twin primes. Five is also a super-prime, and a congruent number.

Five is conjectured to be the only odd untouchable number and if this is the case then five will be the only odd prime number that is not the base of an aliquot tree.

Five is also the only prime that is the sum of two consecutive primes, namely 2 and 3, with these indeed being the only possible set of two consecutive primes.

The number 5 is the fifth Fibonacci number, being 2 plus 3. It is the only Fibonacci number that is equal to its position. Five is also a Pell number and a Markov number, appearing in solutions to the Markov Diophantine equation: (1, 2, 5), (1, 5, 13), (2, 5, 29), (5, 13, 194), (5, 29, 433), ... (OEIS: A030452 lists Markov numbers that appear in solutions where one of the other two terms is 5). Whereas 5 is unique in the Fibonacci sequence, in the Perrin sequence 5 is both the fifth and sixth Perrin numbers.

5 is the length of the hypotenuse of the smallest integer-sided right triangle.

In bases 10 and 20, 5 is a 1-automorphic number.

Five is the second Sierpinski number of the first kind, and can be written as S2 = (22) + 1.

While polynomial equations of degree 4 and below can be solved with radicals, equations of degree 5 and higher cannot generally be so solved. This is the Abel–Ruffini theorem. This is related to the fact that the symmetric group Sn is a solvable group for n ≤ 4 and not solvable for n ≥ 5.

While all graphs with 4 or fewer vertices are planar, there exists a graph with 5 vertices which is not planar: K5, the complete graph with 5 vertices.