Jump to content

41 (number)

From Wikipedia, the free encyclopedia
40 41 42
Cardinalforty-one
Ordinal41st
(forty-first)
Factorizationprime
Prime13th
Divisors1, 41
Greek numeralΜΑ´
Roman numeralXLI, xli
Binary1010012
Ternary11123
Senary1056
Octal518
Duodecimal3512
Hexadecimal2916

41 (forty-one) is the natural number following 40 and preceding 42.

In mathematics

[edit]

41 is the 13th smallest prime number, thus it is a prime index prime because 13 is prime. The next prime number is 43, making both twin primes. It is a regular prime,[1]a Ramanujan prime,[2] a harmonic prime,[3] a good prime,[4] a Newman–Shanks–Williams prime,[5] and the 12th supersingular prime.[6] It is the smallest Sophie Germain prime to start a Cunningham chain of the first kind of three terms, {41, 83, 167}. It is an Eisenstein prime, with no imaginary part and real part of the form 3n  1. It is a Proth prime because 41 = 5 × 23 + 1.[7]

It is the largest lucky number of Euler: the polynomial f(k) = k2k + 41 yields primes for all the integers k with 1 ≤ k < 41.

It is the sum of the first six prime numbers (2 + 3 + 5 + 7 + 11 + 13) and the sum of the first three Mersenne primes, 3, 7, 31.[8]

It is the sum of the sum of the divisors of the first 7 positive integers.

It is the sum of two consecutive squares (42 + 52), which makes it a centered square number.[9]

It is the smallest integer whose reciprocal has a 5-digit repetend. That is a consequence of the fact that 41 is a factor of 99999.

It is the smallest integer whose square root has a simple continued fraction with period 3.[10]

In other fields

[edit]

References

[edit]
  1. "Sloane's A007703 : Regular primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. "Sloane's A104272 : a(n) is the smallest number such that if x >= a(n), then pi(x) - pi(x/2) >= n, where pi(x) is the number of primes <= x". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. "Sloane's A092101 : Harmonic primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. "Sloane's A028388 : prime(n) such that prime(n)^2 > prime(n-i)*prime(n+i) for all 1 <= i <= n-1". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  5. "Sloane's A088165 : NSW primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-30.
  6. "Sloane's A002267 : The 15 supersingular primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-30.
  7. "Sloane's A080076 : Proth primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-30.
  8. Sloane, N. J. A. (ed.). "Sequence A000668 (Mersenne primes (primes of the form 2^n - 1).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-02-09.
  9. Sloane, N. J. A. (ed.). "Sequence A001844 (Centered square numbers: a(n) is 2*n*(n+1)+1. Sums of two consecutive squares. Also, consider all Pythagorean triples (X, Y, Z equal to Y+1) ordered by increasing Z; then sequence gives Z values.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-02-09.
  10. "Sloane's A013646: Least m such that continued fraction for sqrt(m) has period n". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2021-03-18.
  11. "Reference 1". Archived from the original on 2008-05-31. Retrieved 2008-06-13.
  12. "Reference 2". Archived from the original on 2007-11-30. Retrieved 2008-06-13.