Showing content from https://en.wikipedia.org/wiki/59_(number) below:
59 (number) - Wikipedia
From Wikipedia, the free encyclopedia
Natural number
A regular icosahedron has 59 stellations.
59 (fifty-nine) is the natural number following 58 and preceding 60.
Fifty-nine is the 17th prime number, and 7th super-prime. It is also a good prime,[1] a Higgs prime,[2] an irregular prime,[3] a Pillai prime,[4] a Ramanujan prime,[5] a safe prime,[6] and a supersingular prime.[7] The next prime number is sixty-one, with which it comprises a twin prime.
There are 59 stellations of the regular icosahedron.[8]
Fifty-nine is:
- The number corresponding to the last minute in a given hour, and the last second in a given minute.
- The "59-minute rule" is an informal rule in business, whereby (usually near a holiday) employees may be allowed to leave work early, often to beat heavy holiday traffic (the 59 minutes coming from the rule that leaving one full hour early requires the use of leave, whereas leaving 59 minutes early would not).
- The number of beads on a Roman Catholic rosary (Dominican).[9]
- The number on a button commonly worn by feminist activists in the 1970s; this was based on the claim that a woman earned 59 cents to an equally qualified man's dollar.
- The street number in the informal name of the Queensboro Bridge in New York City that appears in the title of Simon and Garfunkel's song "The 59th Street Bridge Song (Feelin' Groovy)".
- The number assigned to Haydn's "Fire" Symphony.
- The biblical numbering of a Davidic psalm of deliverance.
- ^ "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.
- ^ "Sloane's A007459 : a(n+1) = smallest prime > a(n) such that a(n+1)-1 divides the product (a(1)...a(n))^2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ "Sloane's A000928 : primes p such that at least one of the numerators of the Bernoulli numbers B_2, B_4, ..., B_{p-3} is divisible by p". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ "Sloane's A063980 : primes p such that there exists an integer m such that m! + 1 == 0 (mod p) and p != 1 (mod m)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ "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.
- ^ "Sloane's A005385 : (p-1)/2 is also prime". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ "Sloane's A002267 : primes dividing order of Monster simple group". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ H. S. M. Coxeter, P. Du Val, H. T. Flather, and J. F. Petrie. The Fifty-Nine Icosahedra.
- ^ Richard Poe, "Parts of the Rosary", TheChantRosary.com, 2-4-2018
Integers −1 0s
100s
200s
300s
400s
500s
600s
700s
800s
900s
1000s
- 100,000
- 1,000,000
- 10,000,000
- 100,000,000
- 1,000,000,000
- 10,000,000,000
- 100,000,000,000
RetroSearch is an open source project built by @garambo
| Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4