107 (number)
 | This article needs additional citations for verification. (May 2016) |
| ||||
|---|---|---|---|---|
| Cardinal | one hundred seven | |||
| Ordinal | 107th (one hundred seventh) | |||
| Factorization | prime | |||
| Prime | 28th | |||
| Divisors | 1, 107 | |||
| Greek numeral | ΡΖ´ | |||
| Roman numeral | CVII | |||
| Binary | 11010112 | |||
| Ternary | 102223 | |||
| Senary | 2556 | |||
| Octal | 1538 | |||
| Duodecimal | 8B12 | |||
| Hexadecimal | 6B16 | |||
107 (one hundred [and] seven) is the natural number following 106 and preceding 108.
In mathematics
107 is the 28th
Plugged into the expression , 107 yields 162259276829213363391578010288127, 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]
It is the number of triangle-free graphs on 7 vertices.[5]
It is the ninth emirp, because reversing its digits gives another prime number (701)
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 onward.
- The number 107 is also associated with the soccerteam, in reference to the stadium seating section where the group originally congregated.
See also
References
- ^ "Sloane's A109611 : Chen primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-27.
- ^ "Sloane's A000043 : Mersenne exponents". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-27.
- ^ "Sloane's A005385 : Safe primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-27.
- ^ "Sloane's A060843 : Busy Beaver problem: number of steps before halting". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2021-09-24.
- ^ Sloane, N. J. A. (ed.). "Sequence A006785 (Number of triangle-free graphs on n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.