210 (number)
| ||||
|---|---|---|---|---|
| Cardinal | two hundred ten | |||
| Ordinal | 210th (two hundred tenth) | |||
| Factorization | 2 × 3 × 5 × 7 | |||
| Divisors | 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210 | |||
| Greek numeral | ΣΙ´ | |||
| Roman numeral | CCX | |||
| Binary | 110100102 | |||
| Ternary | 212103 | |||
| Quaternary | 31024 | |||
| Quinary | 13205 | |||
| Senary | 5506 | |||
| Octal | 3228 | |||
| Duodecimal | 15612 | |||
| Hexadecimal | D216 | |||
| Vigesimal | AA20 | |||
| Base 36 | 5U36 | |||
210 (two hundred [and] ten) is the natural number following 209 and preceding 211.
In mathematics
210 is a composite number, an abundant number, Harshad number, and the product of the first four prime numbers (2, 3, 5, and 7), and thus a primorial. It is also the least common multiple of these four prime numbers. It is the sum of eight consecutive prime numbers (13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 = 210).[1]
It is a triangular number (following 190 and preceding 231), a pentagonal number (following 176 and preceding 247), and the second smallest to be both triangular and pentagonal (the third is 40755).[1]
It is also an idoneal number, a pentatope number, a pronic number, and an untouchable number. 210 is also the third 71-gonal number, preceding 418.[1] It is the first primorial number greater than 2 which is not adjacent to 2 primes (211 is prime, but 209 is not).
It is the largest number n where the number of distinct representations of n as the sum of two primes is at most the number of primes in the interval [n/2, n-2].[2]
Integers between 211 and 219
211
212
213
214
215
216
217
218
219
See also
- 210 BC
- AD 210
- North American telephone area code area code 210
References
- ↑ 1.0 1.1 1.2 Wells, D. (1987). The Penguin Dictionary of Curious and Interesting Numbers (p. 143). London: Penguin Group.
- ↑ Deshouillers, Jean-Marc; Granville, Andrew; Narkiewicz, Władysław; Pomerance, Carl (1993). "An upper bound in Goldbach's problem". Mathematics of Computation 61 (203): 209–213. doi:10.1090/S0025-5718-1993-1202609-9. Bibcode: 1993MaCom..61..209D.
 |  |
