107 (number)

From Wikipedia, the free encyclopedia
← 106 107 108 →
100 101 102 103 104 105 106 107 108 109
List of numbersIntegers
0 100 200 300 400 500 600 700 800 900
Cardinalone hundred seven
Ordinal107th
(one hundred seventh)
Factorizationprime
Prime28th
Divisors1, 107
Greek numeralΡΖ´
Roman numeralCVII
Binary11010112
Ternary102223
Octal1538
Duodecimal8B12
Hexadecimal6B16

107 (one hundred [and] seven) is the natural number following 106 and preceding 108.

In mathematics[]

107 is the 28th prime number. The next prime is 109, with which it comprises a twin prime, making 107 a Chen prime.[1]

Plugged into the equation , 107 yields 162259276829213363391578010288127, a Mersenne prime.[2] 107 is itself a safe prime.[3]

It is the fourth Busy beaver number, the maximum number of steps that any Turing machine with 2 symbols and 4 states can make before eventually halting.[4]

In other fields[]

As "one hundred and seven", it is the smallest positive integer requiring six syllables in English (without the "and" it only has five syllables and seventy-seven is a smaller 5-syllable number).

107 is also:

  • The atomic number of bohrium.
  • The emergency telephone number in Argentina and Cape Town.
  • The telephone of the police in Hungary.
  • A common designation for the fair use exception in copyright law (from 17 U.S.C. 107)
  • Peugeot 107 model of car

In sports[]

  • The 107% rule, a Formula One Sporting Regulation in operation from 1996 to 2002 and 2011 onwards
  • The number 107 is also associated with the Timbers Army supporters group of the Portland Timbers soccer team, in reference to the stadium seating section where the group originally congregated.

See also[]

References[]

  1. ^ "Sloane's A109611 : Chen primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-27.
  2. ^ "Sloane's A000043 : Mersenne exponents". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-27.
  3. ^ "Sloane's A005385 : Safe primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-27.
  4. ^ "Sloane's A060843 : Busy Beaver problem: number of steps before halting". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2021-09-24.
Retrieved from ""