109 (number)
| ||||
---|---|---|---|---|
Cardinal | one hundred nine | |||
Ordinal |
109th (one hundred and ninth) | |||
Factorization | prime | |||
Prime | 29th | |||
Divisors | 1, 109 | |||
Roman numeral | CIX | |||
Binary | 11011012 | |||
Ternary | 110013 | |||
Quaternary | 12314 | |||
Quinary | 4145 | |||
Senary | 3016 | |||
Octal | 1558 | |||
Duodecimal | 9112 | |||
Hexadecimal | 6D16 | |||
Vigesimal | 5920 | |||
Base 36 | 3136 |
109 (one hundred [and] nine) is the natural number following 108 and preceding 110.
In mathematics
109 is the 29th prime number, so it is a prime with a prime subscript.[1] The previous prime is 107, making them both twin primes.[2] 109 is a centered triangular number.[3]
There are exactly 109 different families of subsets of a three-element set whose union includes all three elements,[4] 109 different loops (invertible but not necessarily associative binary operations with an identity) on six elements.[5] and 109 squares on an infinite chessboard that can be reached by a knight within three moves.[6]
In other fields
109 is also the atomic number of meitnerium.[7]
See also
References
- ↑ "Sloane's A006450 : Primes with prime subscripts". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A006512 : Greater of twin primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A005448 : Centered triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A003465 : Number of ways to cover an n-set". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A057771 : Number of loops (quasigroups with an identity element) of order n". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A018836 : Number of squares on infinite chess-board at ≤ n knight's moves from a fixed square". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Emsley, John (2011), Nature's Building Blocks: An A-Z Guide to the Elements, Oxford University Press, p. 316, ISBN 9780199605637.
This article is issued from Wikipedia - version of the 10/10/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.