210 (number)

Last updated
209 210 211
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
Senary 5506
Octal 3228
Duodecimal 15612
Hexadecimal D216

210 (two hundred [and] ten) is the natural number following 209 and preceding 211.

Contents

Mathematics

210 is an abundant number, [1] and Harshad number. It is the product of the first four prime numbers (2, 3, 5, and 7), and thus a primorial, [2] where it is the least common multiple of these four prime numbers. 210 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 sum of eight consecutive prime numbers, between 13 and the thirteenth prime number: 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 = 210. [3]

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). [3]

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. [3]

210 is index n = 7 in the number of ways to pair up {1, ..., 2n} so that the sum of each pair is prime; i.e., in {1, ..., 14}. [4] [5]

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]. [6]

Integers between 211 and 219

211

212

213

214

215

216

217

218

219

See also

Related Research Articles

72 (seventy-two) is the natural number following 71 and preceding 73. It is half a gross or 6 dozen.

31 (thirty-one) is the natural number following 30 and preceding 32. It is a prime number.

61 (sixty-one) is the natural number following 60 and preceding 62.

104 is the natural number following 103 and preceding 105.

1000 or one thousand is the natural number following 999 and preceding 1001. In most English-speaking countries, it can be written with or without a comma or sometimes a period separating the thousands digit: 1,000.

300 is the natural number following 299 and preceding 301.

400 is the natural number following 399 and preceding 401.

500 is the natural number following 499 and preceding 501.

700 is the natural number following 699 and preceding 701.

600 is the natural number following 599 and preceding 601.

800 is the natural number following 799 and preceding 801.

900 is the natural number following 899 and preceding 901. It is the square of 30 and the sum of Euler's totient function for the first 54 positive integers. In base 10 it is a Harshad number. It is also the first number to be the square of a sphenic number.

2000 is a natural number following 1999 and preceding 2001.

3000 is the natural number following 2999 and preceding 3001. It is the smallest number requiring thirteen letters in English.

4000 is the natural number following 3999 and preceding 4001. It is a decagonal number.

5000 is the natural number following 4999 and preceding 5001. Five thousand is the largest isogrammic numeral in the English language.

6000 is the natural number following 5999 and preceding 6001.

<span class="mw-page-title-main">1,000,000</span> Natural number

One million (1,000,000), or one thousand thousand, is the natural number following 999,999 and preceding 1,000,001. The word is derived from the early Italian millione, from mille, "thousand", plus the augmentative suffix -one.

288 is the natural number following 287 and preceding 289. Because 288 = 2 · 12 · 12, it may also be called "two gross" or "two dozen dozen".

30,000 is the natural number that comes after 29,999 and before 30,001.

References

  1. Sloane, N. J. A. (ed.). "SequenceA005101(Abundant numbers (sum of divisors of m exceeds 2m).)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2024-02-10.
  2. Sloane, N. J. A. (ed.). "SequenceA002110(Primorial numbers (first definition): product of first n primes. Sometimes written prime(n)#.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2024-02-10.
  3. 1 2 3 Wells, D. (1987). The Penguin Dictionary of Curious and Interesting Numbers (p. 143). London: Penguin Group.
  4. Sloane, N. J. A. (ed.). "SequenceA000341(Number of ways to pair up {1..2n} so sum of each pair is prime.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2024-02-10.
  5. Greenfield, Lawrence E.; Greenfield, Stephen J. (1998). "Some Problems of Combinatorial Number Theory Related to Bertrand's Postulate". Journal of Integer Sequences . Waterloo, ON: David R. Cheriton School of Computer Science. 1: Article 98.1.2. MR   1677070. S2CID   230430995. Zbl   1010.11007.
  6. 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. Bibcode:1993MaCom..61..209D. doi: 10.1090/S0025-5718-1993-1202609-9 .