100,000

	List of numbers — Integers ← 100 101 102 103 104 105 106 107 108 109
Cardinal	one hundred thousand
Ordinal	100000th; (one hundred thousandth)
Factorization	25 × 55
Greek numeral
Roman numeral	C
Unicode symbol(s)	ↈ
Binary	110000110101000002
Ternary	120020112013
Octal	3032408
Duodecimal	49A5412
Hexadecimal	186A016

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

Terms for 100000

In 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: แสน, ແສນ, សែន [saen] and ức respectively. The Malagasy word is hetsy.[1] No other major language has a special word for this number, preferring to refer to it as a multiple of smaller numbers.

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

Values of 100000

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: Irish pronunciation: [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 109,999

100,003 – smallest 6-digit prime number[2]
100,128 – smallest triangular number with 6 digits and the 447th triangular number
100,255 – Friedman number[3]
101,101 – smallest palindromic Carmichael number
101,723 – smallest prime number whose square is a pandigital number containing each digit from 0 to 9
102,564 – The smallest parasitic number
103,680 – highly totient number[4]
103,769 – the number of combinatorial types of 5-dimensional parallelohedra
103,823 – 47³, nice Friedman number (−1 + 0 + 3×8×2)³
104,723 – the 9,999th prime number
104,729 – the 10,000th prime number
104,869 – the smallest prime number containing every non-prime digit.
104,976 – 18⁴, 3-smooth number
105,664 – harmonic divisor number[5]
109,376 - 1-automorphic number[6]

110,000 to 119,999

110,880 – highly composite number[7]
111,111 – repunit
111,777 – smallest natural number requiring 17 syllables in American English, 19 in British English
113,634 – Motzkin number for n = 14[8]
114,689 – prime factor of F₁₂
115,975 – Bell number[9]
116,281 – 341², square number, centered decagonal number, 18-gon number
117,067 – first prime vampire number
117,649 – 7⁶
117,800 – harmonic divisor number[5]

120,000 to 149,999

120,284 – Keith number[10]
120,960 – highly totient number[4]
121,393 – Fibonacci number[11]
124,000 – number of Islamic prophets
127,777 – smallest natural number requiring 18 syllables in American English, 20 in British English
127,912 – Wedderburn–Etherington number[12]
128,981 – Starts the first prime gap sequence of 2, 4, 6, 8, 10, 12, 14
129,106 – Keith number[10]

130,321 – 19⁴
131,071 – Mersenne prime[13]
131,072 – 2¹⁷
131,361 – Leyland number[14]
134,340 – Pluto's minor planet designation
135,137 – Markov number[15]

142,129 – 377², square number, dodecagonal number
142,857 – Kaprekar number, Harshad number smallest cyclic number in decimal.
144,000 – number with religious significance
147,640 – Keith number[10]
148,149 – Kaprekar number[16]

150,000 to 199,999

152,381 – unique prime in base 20
156,146 – Keith number[10]

160,000 – 20⁴
161,051 – 11⁵
161,280 – highly totient number[4]
166,320 – highly composite number[7]
167,400 – harmonic divisor number[5]

173,600 – harmonic divisor number[5]
174,680 – Keith number[10]
174,763 – Wagstaff prime[17]
177,147 – 3¹¹
177,777 – smallest natural number requiring 19 syllables in American English, 21 in British English
178,478 – Leyland number[14]

181,440 – highly totient number[4]
181,819 – Kaprekar number[16]
183,186 – Keith number[10]
187,110 – Kaprekar number[16]

194,481 – 21⁴
195,025 – Pell number,[18] Markov number[15]
196,418 – Fibonacci number,[11] Markov number[15]
196,560 – the kissing number in 24 dimensions
196,883 – the dimension of the smallest nontrivial irreducible representation of the Monster group
196,884 – the coefficient of q in the Fourier series expansion of the j-invariant. The adjacency of 196883 and 196884 was important in suggesting monstrous moonshine.

200,000 to 299,999

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 C₁₂[19]
208,335 – the largest number to be both triangular and square pyramidal
208,495 – Kaprekar number[16]
212,159 – smallest unprimeable number ending in 1, 3, 7 or 9[20][21]
221,760 – highly composite number[7]
222,222 – repdigit
234,256 – 22⁴
237,510 – harmonic divisor number[5]
241,920 – highly totient number[4]
242,060 – harmonic divisor number[5]
248,832 – 12⁵, the smallest fifth power that can be represented as the sum of only 6 fifth powers: 12⁵ = 4⁵ + 5⁵ + 6⁵ + 7⁵ + 9⁵ + 11⁵
261,119 – the ninth Carol number $(2^{9}-1)^{2}-2$ [22]
262,144 – 2¹⁸; exponential factorial 4$ of 4;[23] a superperfect number[24]
262,468 – Leyland number[14]
263,167 – Kynea number[25]
268,705 – Leyland number[14]
274,177 – prime factor of the Fermat number F₆
277,200 – highly composite number[7]
279,841 – 23⁴
279,936 – 6⁷
280,859 – a prime number whose square 78881777881 is tridigital
293,547 – Wedderburn–Etherington number[12]
294,001 – smallest weakly prime number in base 10[26]
294,685 – Markov number[15]
298,320 – Keith number[10]

300,000 to 399,999

310,572 – Motzkin number[8]
317,811 – Fibonacci number[11]
318,682 – Kaprekar number[16]
326,981 – alternating factorial[27]
329,967 – Kaprekar number[16]
331,776 – 24⁴
332,640 – highly composite number;[7] harmonic divisor number[5]
333,333 – repdigit
333,667 – sexy prime and unique prime[28]
333,673 – sexy prime
333,679 – sexy prime
337,500 – 2² × 3³ × 5⁵
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[16]
355,419 – Keith number[10]
356,643 – Kaprekar number[16]
360,360 – harmonic divisor number;[5] the smallest number divisible by all of the numbers 1 through 15
362,880 – 9!, highly totient number[4]
370,261 – first prime followed by a prime gap of over 100
371,293 – 13⁵, palindromic in base 12 (15AA51₁₂)
389,305 – self-descriptive number in base 7
390,313 – Kaprekar number[16]
390,625 – 5⁸
397,585 – Leyland number[14]

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[14]
426,389 – Markov number[15]
426,569 – cyclic number in base 12
437,760 to 440,319 – any of these numbers will cause the Apple II+ and Apple //e 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.[29] 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 – 26⁴
461,539 – Kaprekar number[16]
466,830 – Kaprekar number[16]
470,832 – Pell number[18]
483,840 – highly totient number[4]
498,960 – highly composite number[7]
499,393 – Markov number[15]
499,500 – Kaprekar number[16]

500,000 to 599,999

500,500 – Kaprekar number,[16] sum of first 1,000 integers
509,203 – Riesel number[30]
510,510 – the product of the first seven prime numbers, thus the seventh primorial.[31] 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,[32] Markov prime[15]
524,287 – Mersenne prime[13]
524,288 – 2¹⁹
524,649 – Leyland number[14]
531,441 – 3¹²
533,169 – Leyland number[14]
533,170 – Kaprekar number[16]
537,824 – 14⁵
539,400 – harmonic divisor number[5]
548,834 – equal to the sum of the sixth powers of its digits
554,400 – highly composite number[7]
555,555 – repdigit

600,000 to 699,999

604,800 – number of seconds in a week
614,656 – 28⁴
646,018 – Markov number[15]
665,280 – highly composite number[7]
666,666 – repdigit
676,157 – Wedderburn–Etherington number[12]
678,570 – Bell number[9]
694,280 – Keith number[10]
695,520 – harmonic divisor number[5]

700,000 to 799,999

707,281 – 29⁴
720,720 – superior highly composite number;[33] colossally abundant number;[34] the smallest number divisible by all the numbers 1 through 16
725,760 – highly totient number[4]
726,180 – harmonic divisor number[5]
742,900 – Catalan number[19]
753,480 – harmonic divisor number[5]
759,375 – 15⁵
765,623 – emirp, Friedman number 5⁶ × 7² − 6 ÷ 3
777,777 – repdigit, smallest natural number requiring 20 syllables in American English, 22 in British English

800,000 to 899,999

810,000 – 30⁴
823,543 – 7⁷
832,040 – Fibonacci number[11]
853,467 – Motzkin number[8]
873,612 – 1¹ + 2² + 3³ + 4⁴ + 5⁵ + 6⁶ + 7⁷
888,888 – repdigit
890,625 – 1-automorphic number[6]

900,000 to 999,999

909,091 – unique prime
923,521 – 31⁴
925,765 – Markov number[15]
925,993 – Keith number[10]
950,976 – harmonic divisor number[5]
967,680 – highly totient number[4]
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 divisible by 7 and by 13.

References

"Malagasy Dictionary and Madagascar Encyclopedia : hetsy". malagasyword.org. 26 October 2017. Retrieved 2019-12-31.
Sloane, N. J. A. (ed.). "Sequence A003617 (Smallest n-digit prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 7 September 2017.
"Problem of the Month (August 2000)". Archived from the original on 2012-12-18. Retrieved 2013-01-13.
Sloane, N. J. A. (ed.). "Sequence A097942 (Highly totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A001599 (Harmonic or Ore numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-04-06.
Sloane, N. J. A. (ed.). "Sequence A002182 (Highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A000110 (Bell or exponential numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
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.
Sloane, N. J. A. (ed.). "Sequence A000045 (Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A001190 (Wedderburn-Etherington numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A000668 (Mersenne primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A002559 (Markoff (or Markov) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A006886 (Kaprekar numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A000979 (Wagstaff primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A000108 (Catalan numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Collins, Julia (2019). Numbers in Minutes. United Kingdom: Quercus. p. 140. ISBN 1635061776.
Sloane, N. J. A. (ed.). "Sequence A143641 (Odd prime-proof numbers not ending in 5)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
"Sloane's A093112 : a(n) = (2^n-1)^2 - 2". Archived from the original on 2016-06-23. Retrieved 2016-06-17.
"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.
Sloane, N. J. A. (ed.). "Sequence A019279 (Superperfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
"Sloane's A093069 : a(n) = (2^n + 1)^2 - 2". Archived from the original on 2016-08-05. Retrieved 2016-06-17.
Weißstein, Eric W. (25 December 2020). "Weakly Prime". Wolfram MathWorld.
Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A040017 (Unique period primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
"Archived copy". Archived from the original on 2016-04-15. Retrieved 2016-04-04.CS1 maint: archived copy as title (link) Disassembled ROM. See comments at $DA1E.
Sloane, N. J. A. (ed.). "Sequence A101036 (Riesel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A002110 (Primorial numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A005478 (Prime Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A002201 (Superior highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
Sloane, N. J. A. (ed.). "Sequence A004490 (Colossally abundant numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] "Malagasy Dictionary and Madagascar Encyclopedia : hetsy". malagasyword.org. 26 October 2017. Retrieved 2019-12-31.

[A003617-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.

[:10-4] Sloane, N. J. A. (ed.). "Sequence A097942 (Highly totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[:0-5] Sloane, N. J. A. (ed.). "Sequence A001599 (Harmonic or Ore numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[automorphic-6] Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-04-06.

[:1-7] Sloane, N. J. A. (ed.). "Sequence A002182 (Highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[:2-8] Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[:3-9] Sloane, N. J. A. (ed.). "Sequence A000110 (Bell or exponential numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[:4-10] 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.

[:5-11] Sloane, N. J. A. (ed.). "Sequence A000045 (Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[:6-12] Sloane, N. J. A. (ed.). "Sequence A001190 (Wedderburn-Etherington numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[:7-13] Sloane, N. J. A. (ed.). "Sequence A000668 (Mersenne primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[:8-14] Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[:9-15] Sloane, N. J. A. (ed.). "Sequence A002559 (Markoff (or Markov) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[:11-16] Sloane, N. J. A. (ed.). "Sequence A006886 (Kaprekar numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[17] Sloane, N. J. A. (ed.). "Sequence A000979 (Wagstaff primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[:12-18] Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[:13-19] Sloane, N. J. A. (ed.). "Sequence A000108 (Catalan numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[20] Collins, Julia (2019). Numbers in Minutes. United Kingdom: Quercus. p. 140. ISBN 1635061776.

[21] Sloane, N. J. A. (ed.). "Sequence A143641 (Odd prime-proof numbers not ending in 5)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

[22] "Sloane's A093112 : a(n) = (2^n-1)^2 - 2". Archived from the original on 2016-06-23. Retrieved 2016-06-17.

[23] "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.

[24] Sloane, N. J. A. (ed.). "Sequence A019279 (Superperfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[25] "Sloane's A093069 : a(n) = (2^n + 1)^2 - 2". Archived from the original on 2016-08-05. Retrieved 2016-06-17.

[26] Weißstein, Eric W. (25 December 2020). "Weakly Prime". Wolfram MathWorld.

[27] Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[28] Sloane, N. J. A. (ed.). "Sequence A040017 (Unique period primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[29] "Archived copy". Archived from the original on 2016-04-15. Retrieved 2016-04-04.CS1 maint: archived copy as title (link) Disassembled ROM. See comments at $DA1E.

[30] Sloane, N. J. A. (ed.). "Sequence A101036 (Riesel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[31] Sloane, N. J. A. (ed.). "Sequence A002110 (Primorial numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[32] Sloane, N. J. A. (ed.). "Sequence A005478 (Prime Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[33] Sloane, N. J. A. (ed.). "Sequence A002201 (Superior highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.

[34] Sloane, N. J. A. (ed.). "Sequence A004490 (Colossally abundant numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.