57 (number)

Source: Wikipedia, the free encyclopedia.
← 56 57 58 →
Cardinalfifty-seven
Ordinal57th
(fifty-seventh)
Factorization3 × 19
Divisors1, 3, 19, 57
Greek numeralΝΖ´
Roman numeralLVII
Binary1110012
Ternary20103
Senary1336
Octal718
Duodecimal4912
Hexadecimal3916

57 (fifty-seven) is the natural number following 56 and preceding 58.

In mathematics

Fifty-seven is the sixteenth discrete semiprime[1] (specifically, the sixth semiprime of the form , where is a prime strictly larger than 3).[2] It also forms the fourth discrete semiprime pair with 58.

57 is the third

cube of 7,[6] and 703 the sum of the first thirty-seven nonzero integers.[7] Fifty seven is also a repdigit in base-7 (111).[8]

57 is the fifth Leyland number, as it can be written in the form:[9]

57 is the number of compositions of 10 into distinct parts.[10]

57 is the seventh

nodes having root of even degree.[11]

57 is also the number of nodes in a

regular octagon when all of its diagonals are drawn,[12] and the first non-trivial icosagonal (20-gonal) number.[13]

In geometry, there are:

The split

Heisenberg algebra as its nilradical, and the smallest possible homogeneous space for E8 is also 57-dimensional.[16]

57 lies between prime numbers 53 and 61, which are the only two prime numbers less than 71 that do not divide the order of any sporadic group, inclusive of the six pariahs. 71, the twentieth prime number, is the largest supersingular prime that divides the largest of these groups[17] while 57, on the other hand, is the fortieth composite number whose sum of divisors σ(57) is 80 and averages 20.[18][19]

Although fifty-seven is not prime, it is jokingly known as the Grothendieck prime after a story in which mathematician Alexander Grothendieck supposedly gave it as an example of a particular prime number. This story is repeated in Part II of a biographical article on Grothendieck in Notices of the American Mathematical Society.[20] However, its veracity is questionable, and it may be a confounded misattribution of the same blunder committed to writing by Hermann Weyl.[21]

In science

Astronomy

In fiction and media

In films

  • Passenger 57, a film starring Wesley Snipes
  • In the movie Contagion, Vaccine #57 successfully protects the lab monkey from infection.
  • The Terminal (2004) starring Tom Hanks. There are 57 members of the jazz band that Viktor Navorski carries a picture of with him.
  • in the movie Eraser (1996), the weapons trade operation took place at the Baltimore Docks, Pier 57.

In games

  • In the game Hollow Knight, a character named Zote the Mighty has 57 precepts, all of which offer rather humorous, lackluster, or completely bad advice to the player.

In literature

  • In Rudyard Kipling's short story "
    India's First War of Independence
    , against British Rule.
  • Battle of Koom Valley on Discworld (a fictional world created by author Terry Pratchett
    )

In radio

In television

In food

  • Heinz 57, a brand of sauce, and the number of varieties of foods claimed to be produced by the H.J. Heinz Company

In music

  • "Incident on 57th Street", a song by Bruce Springsteen and the E Street Band, from their 1973 album, The Wild, the Innocent and the E Street Shuffle
  • "57 Channels (And Nothin' On)", a song by Bruce Springsteen, from his 1992 album Human Touch
  • "57", the name of a song by Biffy Clyro on their 2002 debut album, Blackened Sky
  • Shure SM57, considered the workhorse of recording microphones

In organizations

  • The number of the French department Moselle

In places

In transportation and vessels

In other fields

See also

References

  1. ^ Sloane, N. J. A. (ed.). "Sequence A001358 (Semiprimes (or biprimes): products of two primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. ^ Sloane, N. J. A. (ed.). "Sequence A001748 (Semiprimes of the form a(n) equal to 3 x prime(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^ Sloane, N. J. A. (ed.). "Sequence A016105 (Blum integers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^ Sloane, N. J. A. (ed.). "Sequence A001065 (Sum of proper divisors (or aliquot parts) of n: sum of divisors of n that are less than n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  5. ^ Sloane, N. J. A. (ed.). "Sequence A001065 (Sum of proper divisors (or aliquot parts) of n: sum of divisors of n that are less than n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  6. ^ Sloane, N. J. A. (ed.). "Sequence A000578 (The cubes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  7. ^ Sloane, N. J. A. (ed.). "Sequence A000217 (Triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  8. ^ Sloane, N. J. A. (ed.). "Sequence A048332 (Numbers that are repdigits in base 7)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  9. ^ Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  10. ^ Sloane, N. J. A. (ed.). "Sequence A032020 (Number of compositions (ordered partitions) of n into distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  11. ^ Sloane, N. J. A. (ed.). "Sequence A000957 (Fine's sequence (or Fine numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-01.
  12. ^ Sloane, N. J. A. (ed.). "Sequence A007569 (Number of nodes in regular n-gon with all diagonals drawn)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  13. ^ Sloane, N. J. A. (ed.). "Sequence A051872 (20-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  14. S2CID 122634260
    .
  15. ^ Sloane, N. J. A. (ed.). "Sequence A002267 (The 15 supersingular primes: primes dividing order of Monster simple group)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  16. ^ Sloane, N. J. A. (ed.). "Sequence A002808 (The composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  17. ^ Sloane, N. J. A. (ed.). "Sequence A000203 (a(n) = sigma(n), the sum of the divisors of n. Also called sigma_1(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  18. .
  19. .
  20. ^ The NGC / IC Project - Home of the Historically Corrected New General Catalogue (HCNGC) since 1993