Jump to content

100,000

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Certes (talk | contribs) at 20:21, 22 October 2023 (Undid revision 1181387744 by 196.190.61.49 (talk): wrong number). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

"100000" redirects here. For other uses, see 100000 (disambiguation).
← 99999 100000 100001 →
Cardinalone hundred thousand
Ordinal100000th
(one hundred thousandth)
Factorization25 × 55
Greek numeral
Roman numeralC
Binary110000110101000002
Ternary120020112013
Senary20505446
Octal3032408
Duodecimal49A5412
Hexadecimal186A016

100,000 (one hundred thousand) is the natural number following 99,999 and preceding 100,001. In scientific notation, it is written as 105.

Terms for 100,000

In Bangladesh, India, Pakistan and South Asia, one hundred thousand is called a lakh, and is written as 1,00,000. The Thai, Lao, Khmer and Vietnamese languages also have separate words for this number: แสน, ແສນ, សែន (all saen), and ức respectively. The Malagasy word is hetsy.[1]

In Cyrillic numerals, it is known as the legion (легион): or .

Values of 100,000

In astronomy, 100,000 metres, 100 kilometres, or 100 km (62 miles) is the altitude at which the Fédération Aéronautique Internationale (FAI) defines spaceflight to begin.

In the Irish language, céad míle fáilte (pronounced [ˌceːd̪ˠ ˈmʲiːlʲə ˈfˠaːlʲtʲə]) is a popular greeting meaning "a hundred thousand welcomes".

Selected 6-digit numbers (100,001–999,999)

100,001 to 199,999

200,000 to 299,999

  • 202,717 = k such that the sum of the squares of the first k primes is divisible by k.[27]
  • 206,098 – Large Schröder number
  • 206,265 = rounded number of arc seconds in a radian (see also parsec), since ⁠180 × 60 × 60/π⁠ = 206,264.806...
  • 207,360 = highly totient number[4]
  • 208,012 = the Catalan number C12[28]
  • 208,335 = the largest number to be both triangular and square pyramidal
  • 208,495 = Kaprekar number[19]
  • 212,159 = smallest unprimeable number ending in 1, 3, 7 or 9[29][30]
  • 221,760 = highly composite number[8]
  • 222,222 = repdigit
  • 227,475 = Riordan number
  • 234,256 = 224
  • 237,510 = harmonic divisor number[6]
  • 238,591 = number of free 13-ominoes
  • 241,920 = highly totient number[4]
  • 242,060 = harmonic divisor number[6]
  • 248,832 = 125, 100,00012, AKA a gross-great-gross (10012 great-grosses); the smallest fifth power that can be represented as the sum of only 6 fifth powers: 125 = 45 + 55 + 65 + 75 + 95 + 115
  • 262,144 = 218; exponential factorial of 4;[31] a superperfect number[32]
  • 262,468 = Leyland number[17]
  • 268,705 = Leyland number[17]
  • 274,177 = prime factor of the Fermat number F6
  • 275,807/195,025 ≈ √2
  • 276,480 = number of primitive polynomials of degree 24 over GF(2)[33]
  • 277,200 = highly composite number[8]
  • 279,841 = 234
  • 279,936 = 67
  • 280,859 = a prime number whose square 78881777881 is tridigital
  • 291,400 = number of non-equivalent ways of expressing 100,000,000 as the sum of two prime numbers[34]
  • 293,547 = Wedderburn–Etherington number[15]
  • 294,001 = smallest weakly prime number in base 10[35]
  • 294,685 = Markov number[18]
  • 298,320 = Keith number[12]

300,000 to 399,999

  • 310,572 = Motzkin number[9]
  • 316,749 = number of reduced trees with 27 nodes[36]
  • 317,811 = Fibonacci number[13]
  • 318,682 = Kaprekar number[19]
  • 325,878 = Fine number[37]
  • 326,981 = alternating factorial[38]
  • 329,967 = Kaprekar number[19]
  • 331,776 = 244
  • 332,640 = highly composite number;[8] harmonic divisor number[6]
  • 333,333 = repdigit
  • 333,667 = sexy prime and unique prime[39]
  • 333,673 = sexy prime with 333,679
  • 333,679 = sexy prime with 333,673
  • 337,500 = 22 × 33 × 55
  • 337,594 = number of 25-bead necklaces (turning over is allowed) where complements are equivalent[40]
  • 349,716 = number of 24-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[41]
  • 351,351 = only known odd abundant number that is not the sum of some of its proper, nontrivial (i.e. >1) divisors (sequence A122036 in the OEIS).
  • 351,352 = Kaprekar number[19]
  • 355,419 = Keith number[12]
  • 356,643 = Kaprekar number[19]
  • 356,960 = number of primitive polynomials of degree 23 over GF(2)[42]
  • 360,360 = harmonic divisor number;[6] the smallest number divisible by all of the numbers 1 through 15
  • 362,880 = 9!, highly totient number[4]
  • 369,119 = prime number which divides the sum of all primes less than or equal to it[43]
  • 370,261 = first prime followed by a prime gap of over 100
  • 371,293 = 135, palindromic in base 12 (15AA5112)
  • 389,305 = self-descriptive number in base 7
  • 390,313 = Kaprekar number[19]
  • 390,625 = 58
  • 397,585 = Leyland number[17]

400,000 to 499,999

  • 409,113 = sum of the first nine factorials
  • 422,481 = smallest number whose fourth power is the sum of three smaller fourth powers
  • 423,393 = Leyland number[17]
  • 426,389 = Markov number[18]
  • 426,569 = cyclic number in base 12
  • 437,760 to 440,319 = any of these numbers will cause the Apple II+ and Apple IIe computers to crash to a monitor prompt when entered at the BASIC prompt, due to a short-cut in the Applesoft code programming of the overflow test when evaluating 16-bit numbers.[44] Entering 440000 at the prompt has been used to hack games that are protected against entering commands at the prompt after the game is loaded.
  • 444,444 = repdigit
  • 456,976 = 264
  • 461,539 = Kaprekar number[19]
  • 466,830 = Kaprekar number[19]
  • 470,832 = Pell number[26]
  • 483,840 = highly totient number[4]
  • 498,960 = highly composite number[8]
  • 499,393 = Markov number[18]
  • 499,500 = Kaprekar number[19]

500,000 to 599,999

  • 500,500 = Kaprekar number,[19] sum of first 1,000 integers
  • 509,203 = Riesel number[45]
  • 510,510 = the product of the first seven prime numbers, thus the seventh primorial.[46] It is also the product of four consecutive Fibonacci numbers—13, 21, 34, 55, the highest such sequence of any length to be also a primorial. And it is a double triangular number, the sum of all even numbers from 0 to 1428.
  • 514,229 = Fibonacci prime,[47] Markov prime[18]
  • 518,859 = little Schroeder number
  • 524,287 = Mersenne prime[16]
  • 524,288 = 219
  • 524,649 = Leyland number[17]
  • 525,600 = minutes in a non-leap year
  • 527,040 = minutes in a leap year
  • 531,441 = 312
  • 533,169 = Leyland number[17]
  • 533,170 = Kaprekar number[19]
  • 537,824 = 145
  • 539,400 = harmonic divisor number[6]
  • 548,834 = equal to the sum of the sixth powers of its digits
  • 554,400 = highly composite number[8]
  • 555,555 = repdigit
  • 599,999 = prime number.

600,000 to 699,999

  • 604,800 = number of seconds in a week
  • 614,656 = 284
  • 625,992 = Riordan number
  • 629,933 = number of reduced trees with 28 nodes[48]
  • 646,018 = Markov number[18]
  • 649,532 = number of 26-bead necklaces (turning over is allowed) where complements are equivalent[49]
  • 664,579 = the number of primes under 10,000,000
  • 665,280 = highly composite number[8]
  • 665,857/470,832 ≈ √2
  • 666,666 = repdigit
  • 671,092 = number of 25-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[50]
  • 676,157 = Wedderburn–Etherington number[15]
  • 678,570 = Bell number[10]
  • 694,280 = Keith number[12]
  • 695,520 = harmonic divisor number[6]

700,000 to 799,999

  • 700,001 = prime number.
  • 707,281 = 294
  • 720,720 = superior highly composite number;[51] colossally abundant number;[52] the smallest number divisible by all the numbers 1 through 16
  • 725,760 = highly totient number[4]
  • 726,180 = harmonic divisor number[6]
  • 729,000 = 903
  • 739,397 = largest prime that is both right- and left-truncatable.
  • 742,900 = Catalan number[28]
  • 753,480 = harmonic divisor number[6]
  • 759,375 = 155
  • 765,623 = emirp, Friedman prime 56 × 72 − 6 ÷ 3
  • 777,777 = repdigit, smallest natural number requiring 20 syllables in American English, 22 in British English, largest number in English not containing the letter 'i' in its name
  • 783,700 = initial number of third century xx00 to xx99 (after 400 and 1,400) containing seventeen prime numbers[53][a] {783,701, 783,703, 783,707, 783,719, 783,721, 783,733, 783,737, 783,743, 783,749, 783,763, 783,767, 783,779, 783,781, 783,787, 783,791, 783,793, 783,799}
  • 799,999 = prime number.

800,000 to 899,999

  • 810,000 = 304
  • 823,543 = 77
  • 825,265 = smallest Carmichael number with 5 prime factors
  • 832,040 = Fibonacci number[13]
  • 853,467 = Motzkin number[9]
  • 857,375 = 953
  • 873,612 = 11 + 22 + 33 + 44 + 55 + 66 + 77
  • 888,888 = repdigit
  • 890,625 = 1-automorphic number[7]

900,000 to 999,999

"999999" redirects here. For the string of nines in pi, see Six nines in pi.
  • 900,001 = prime number
  • 901,971 = number of free 14-ominoes
  • 909,091 = unique prime in base 10
  • 923,521 = 314
  • 925,765 = Markov number[18]
  • 925,993 = Keith number[12]
  • 950,976 = harmonic divisor number[6]
  • 967,680 = highly totient number[4]
  • 970,299 = 993, the largest 6-digit cube
  • 998,001 = 9992, the largest 6-digit square. The reciprocal of this number, in its expanded form, lists all three-digit numbers in order except 998.[55]
  • 998,991 = highest triangular number with 6 digits and the 1,413th triangular number
  • 999,983 = largest 6-digit prime number
  • 999,999 = repdigit. Rational numbers with denominators 7 and 13 have 6-digit repetends when expressed in decimal form, because 999999 is the smallest number one less than a power of 10 that is divisible by 7 and by 13, and it is the largest number in English not containing the letter 'l' in its name.

Prime numbers

Increments of 105 from zero through a million have the following prime counts:

  • 9,592 primes between 0 and 100,000.
99,991 is the largest prime number less than 100,000.
  • 8,392 primes between 100,000 and 200,000.[b]
This is a difference of 1,200 primes from the previous range.
104,729 is the 10,000th prime in this range.
199,999 is prime.
  • 8,013 primes between 200,000 and 300,000.[c]
A difference of 379 primes from the previous range.
224,737 is the 20,000th prime.
  • 7,863 primes between 300,000 and 400,000.[d]
A difference of 150 primes from the previous range.
350,377 is the 30,000th prime.
  • 7,678 primes between 400,000 and 500,000.[e]
A difference of 185 primes from the previous range.
Here, the difference increases by a count of 35.
479,909 is the 40,000th prime.
  • 7,560 primes between 500,000 and 600,000.[f]
A difference of 118 primes from the previous range.
7,560 is the twentieth highly composite number.[56]
599,999 is prime.
  • 7,445 primes between 600,000 and 700,000.[g]
A difference of 115 primes from the previous range.
611,953 is the 50,000th prime.
  • 7,408 primes between 700,000 and 800,000.[h]
A difference of 37 primes from the previous range.
700,001 and 799,999 are both prime.
746,773 is the 60,000th prime.
  • 7,323 primes between 800,000 and 900,000.[i]
A difference of 85 primes from the previous range.
Here, the difference increases by a count of 48.
882,377 is the 70,000th prime.
A difference of 99 primes from the previous range.
The difference increases again, by a count of 14.
900,001 is prime.

In total, there are 68,906 prime numbers between 100,000 and 1,000,000.[57]

Notes

  1. ^ There are no centuries containing more than seventeen primes between 200 and 122,853,771,370,899 inclusive.[54]
  2. ^ Smallest p > 100,000 is 100,003 (9,593rd); largest p < 200,000 is 199,999 (17,984th).
  3. ^ Smallest p > 200,000 is 200,003 (17,985th); largest p < 300,000 is 299,993 (25,997th).
  4. ^ Smallest p > 300,000 is 300,007 (25,998th); largest p < 400,000 is 399,989 (33,860th).
  5. ^ Smallest p > 400,000 is 400,009 (33,861st); largest p < 500,000 is 499,979 (41,538th).
  6. ^ Smallest p > 500,000 is 500,009 (41,539th); largest p < 600,000 is 599,999 (49,098th).
  7. ^ Smallest p > 600,000 is 600,011 (49,099th); largest p < 700,000 is 699,967 (56,543rd).
  8. ^ Smallest p > 700,000 is 700,001 (56,544th); largest p < 800,000 is 799,999 (63,951st).
  9. ^ Smallest p > 800,000 is 800,011 (63,952nd); largest p < 900,000 is 899,981 (71,274th).
  10. ^ Smallest p > 900,000 is 900,001 (71,275th); largest p < 1,000,000 is 999,983 (78,498th).

References

  1. ^ "Malagasy Dictionary and Madagascar Encyclopedia : hetsy". malagasyword.org. 26 October 2017. Retrieved 2019-12-31.
  2. ^ Sloane, N. J. A. (ed.). "Sequence A003617 (Smallest n-digit prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 7 September 2017.
  3. ^ "Problem of the Month (August 2000)". Archived from the original on 2012-12-18. Retrieved 2013-01-13.
  4. ^ a b c d e f g h i j Sloane, N. J. A. (ed.). "Sequence A097942 (Highly totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  5. ^ Sloane, N. J. A. (ed.). "Sequence A006785 (Number of triangle-free graphs on n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  6. ^ a b c d e f g h i j k l m Sloane, N. J. A. (ed.). "Sequence A001599 (Harmonic or Ore numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  7. ^ a b Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-04-06.
  8. ^ a b c d e f g h Sloane, N. J. A. (ed.). "Sequence A002182 (Highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  9. ^ a b c Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  10. ^ a b Sloane, N. J. A. (ed.). "Sequence A000110 (Bell or exponential numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  11. ^ Sloane, N. J. A. (ed.). "Sequence A011260 (Number of primitive polynomials of degree n over GF(2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  12. ^ a b c d e f g h i j Sloane, N. J. A. (ed.). "Sequence A007629 (Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers)access-date=2016-06-17)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  13. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A000045 (Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  14. ^ Sloane, N. J. A. (ed.). "Sequence A002104 (Logarithmic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  15. ^ a b c Sloane, N. J. A. (ed.). "Sequence A001190 (Wedderburn-Etherington numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  16. ^ a b Sloane, N. J. A. (ed.). "Sequence A000668 (Mersenne primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  17. ^ a b c d e f g h Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  18. ^ a b c d e f g h i Sloane, N. J. A. (ed.). "Sequence A002559 (Markoff (or Markov) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  19. ^ a b c d e f g h i j k l m n Sloane, N. J. A. (ed.). "Sequence A006886 (Kaprekar numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  20. ^ Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  21. ^ Sloane, N. J. A. (ed.). "Sequence A000258 (Expansion of e.g.f. exp(exp(exp(x)-1)-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  22. ^ Sloane, N. J. A. (ed.). "Sequence A000979 (Wagstaff primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  23. ^ Sloane, N. J. A. (ed.). "Sequence A000011 (Number of n-bead necklaces (turning over is allowed) where complements are equivalent)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  24. ^ Sloane, N. J. A. (ed.). "Sequence A000013 (Definition (1): Number of n-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  25. ^ Sloane, N. J. A. (ed.). "Sequence A000112 (Number of partially ordered sets (posets) with n unlabeled elements)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  26. ^ a b Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  27. ^ Sloane, N. J. A. (ed.). "Sequence A111441 (Numbers k such that the sum of the squares of the first k primes is divisible by k)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-02.
  28. ^ a b Sloane, N. J. A. (ed.). "Sequence A000108 (Catalan numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  29. ^ Collins, Julia (2019). Numbers in Minutes. United Kingdom: Quercus. p. 140. ISBN 978-1635061772.
  30. ^ Sloane, N. J. A. (ed.). "Sequence A143641 (Odd prime-proof numbers not ending in 5)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  31. ^ "Sloane's A049384 : a(0)=1, a(n+1) = (n+1)^a(n)access-date=2016-06-17". Archived from the original on 2016-05-26.
  32. ^ Sloane, N. J. A. (ed.). "Sequence A019279 (Superperfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  33. ^ Sloane, N. J. A. (ed.). "Sequence A011260 (Number of primitive polynomials of degree n over GF(2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  34. ^ Sloane, N. J. A. (ed.). "Sequence A065577 (Number of Goldbach partitions of 10^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-08-31.
  35. ^ Weißstein, Eric W. (25 December 2020). "Weakly Prime". Wolfram MathWorld.
  36. ^ Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  37. ^ Sloane, N. J. A. (ed.). "Sequence A000957 (Fine's sequence (or Fine numbers): number of relations of valence greater than or equal to 1 on an n-set; also number of ordered rooted trees with n edges having root of even degree)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-01.
  38. ^ Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  39. ^ Sloane, N. J. A. (ed.). "Sequence A040017 (Unique period primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  40. ^ Sloane, N. J. A. (ed.). "Sequence A000011 (Number of n-bead necklaces (turning over is allowed) where complements are equivalent)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  41. ^ Sloane, N. J. A. (ed.). "Sequence A000013 (Definition (1): Number of n-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  42. ^ Sloane, N. J. A. (ed.). "Sequence A011260 (Number of primitive polynomials of degree n over GF(2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  43. ^ "A007506 - OEIS". oeis.org. Retrieved 2023-10-03.
  44. ^ "Applesoft Disassembly -- S.d912". Archived from the original on 2016-04-15. Retrieved 2016-04-04. Disassembled ROM. See comments at $DA1E.
  45. ^ Sloane, N. J. A. (ed.). "Sequence A101036 (Riesel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  46. ^ Sloane, N. J. A. (ed.). "Sequence A002110 (Primorial numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  47. ^ Sloane, N. J. A. (ed.). "Sequence A005478 (Prime Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  48. ^ Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  49. ^ Sloane, N. J. A. (ed.). "Sequence A000011 (Number of n-bead necklaces (turning over is allowed) where complements are equivalent)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  50. ^ Sloane, N. J. A. (ed.). "Sequence A000013 (Definition (1): Number of n-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  51. ^ Sloane, N. J. A. (ed.). "Sequence A002201 (Superior highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  52. ^ Sloane, N. J. A. (ed.). "Sequence A004490 (Colossally abundant numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
  53. ^ Sloane, N. J. A. (ed.). "Sequence A186509 (Centuries containing 17 primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-06-16.
  54. ^ Sloane, N. J. A. (ed.). "Sequence A186311 (Least century 100k to 100k+99 with exactly n primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-06-16.
  55. ^ "Dividing one by 998001 produces list of three digit numbers". 23 January 2012.
  56. ^ "Sloane's A002182 : Highly composite numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-12-04.
  57. ^ Caldwell, Chris K. "The Nth Prime Page". PrimePages. Retrieved 2022-12-03.
    From the differences of the prime indexes of the smallest and largest prime numbers in ranges of increments of 105, plus 1 (for each range).
Retrieved from "https://en.wikipedia.org/w/index.php?title=100,000&oldid=1181399191"