J u m p t o c o n t e n t
M a i n m e n u
M a i n m e n u
N a v i g a t i o n
● M a i n p a g e
● C o n t e n t s
● C u r r e n t e v e n t s
● R a n d o m a r t i c l e
● A b o u t W i k i p e d i a
● C o n t a c t u s
● D o n a t e
C o n t r i b u t e
● H e l p
● L e a r n t o e d i t
● C o m m u n i t y p o r t a l
● R e c e n t c h a n g e s
● U p l o a d f i l e
S e a r c h
Search
A p p e a r a n c e
● C r e a t e a c c o u n t
● L o g i n
P e r s o n a l t o o l s
● C r e a t e a c c o u n t
● L o g i n
P a g e s f o r l o g g e d o u t e d i t o r s l e a r n m o r e
● C o n t r i b u t i o n s
● T a l k
( T o p )
1
S e l e c t e d 9 - d i g i t n u m b e r s ( 1 0 0 , 0 0 0 , 0 0 1 – 9 9 9 , 9 9 9 , 9 9 9 )
T o g g l e S e l e c t e d 9 - d i g i t n u m b e r s ( 1 0 0 , 0 0 0 , 0 0 1 – 9 9 9 , 9 9 9 , 9 9 9 ) s u b s e c t i o n
1 . 1
1 0 0 , 0 0 0 , 0 0 1 t o 1 9 9 , 9 9 9 , 9 9 9
1 . 2
2 0 0 , 0 0 0 , 0 0 0 t o 2 9 9 , 9 9 9 , 9 9 9
1 . 3
3 0 0 , 0 0 0 , 0 0 0 t o 3 9 9 , 9 9 9 , 9 9 9
1 . 4
4 0 0 , 0 0 0 , 0 0 0 t o 4 9 9 , 9 9 9 , 9 9 9
1 . 5
5 0 0 , 0 0 0 , 0 0 0 t o 5 9 9 , 9 9 9 , 9 9 9
1 . 6
6 0 0 , 0 0 0 , 0 0 0 t o 6 9 9 , 9 9 9 , 9 9 9
1 . 7
7 0 0 , 0 0 0 , 0 0 0 t o 7 9 9 , 9 9 9 , 9 9 9
1 . 8
8 0 0 , 0 0 0 , 0 0 0 t o 8 9 9 , 9 9 9 , 9 9 9
1 . 9
9 0 0 , 0 0 0 , 0 0 0 t o 9 9 9 , 9 9 9 , 9 9 9
2
R e f e r e n c e s
T o g g l e t h e t a b l e o f c o n t e n t s
1 0 0 , 0 0 0 , 0 0 0
1 9 l a n g u a g e s
● ا ل ع ر ب ي ة
● A z ə r b a y c a n c a
● E u s k a r a
● 客 家 語 / H a k - k â - n g î
● 한 국 어
● L a t v i e š u
● മ ല യ ാ ള ം
● म र ा ठ ी
● B a h a s a M e l a y u
● ꯃ ꯤ ꯇ ꯩ ꯂ ꯣ ꯟ
● 日 本 語
● پ ن ج ا ب ی
● P o r t u g u ê s
● ไ ท ย
● T ü r k ç e
● ا ر د و
● T i ế n g V i ệ t
● 粵 語
● 中 文
E d i t l i n k s
● A r t i c l e
● T a l k
E n g l i s h
● R e a d
● E d i t
● V i e w h i s t o r y
T o o l s
T o o l s
A c t i o n s
● R e a d
● E d i t
● V i e w h i s t o r y
G e n e r a l
● W h a t l i n k s h e r e
● R e l a t e d c h a n g e s
● U p l o a d f i l e
● S p e c i a l p a g e s
● P e r m a n e n t l i n k
● P a g e i n f o r m a t i o n
● C i t e t h i s p a g e
● G e t s h o r t e n e d U R L
● D o w n l o a d Q R c o d e
● W i k i d a t a i t e m
P r i n t / e x p o r t
● D o w n l o a d a s P D F
● P r i n t a b l e v e r s i o n
I n o t h e r p r o j e c t s
● W i k i m e d i a C o m m o n s
A p p e a r a n c e
F r o m W i k i p e d i a , t h e f r e e e n c y c l o p e d i a
"Hundred million" redirects here. For the song by Treble Charger, see
Hundred Million .
Natural number
100,000,000 (one hundred million ) is the natural number following 99,999,999 and preceding 100,000,001.
In scientific notation , it is written as 108 .
East Asian languages treat 100,000,000 as a counting unit, significant as the square of a myriad , also a counting unit. In Chinese, Korean, and Japanese respectively it is yi (simplified Chinese : 亿 ; traditional Chinese : 億 ; pinyin : yì ) (or Chinese : 萬萬 ; pinyin : wànwàn in ancient texts), eok (억/億 ) and oku (億 ). These languages do not have single words for a thousand to the second, third, fifth powers, etc.
100,000,000 is also the fourth power of 100 and also the square of 10000 .
Selected 9-digit numbers (100,000,001–999,999,999)
[ edit ]
100,000,001 to 199,999,999
[ edit ]
100,000,007 = smallest nine digit prime[1]
100,005,153 = smallest triangular number with 9 digits and the 14,142nd triangular number
100,020,001 = 100012 , palindromic square
100,544,625 = 4653 , the smallest 9-digit cube
102,030,201 = 101012 , palindromic square
102,334,155 = Fibonacci number
102,400,000 = 405
104,060,401 = 102012 = 1014 , palindromic square
104,636,890 = number of trees with 25 unlabeled nodes[2]
105,413,504 = 147
107,890,609 = Wedderburn-Etherington number [3]
111,111,111 = repunit , square root of 12345678987654321
111,111,113 = Chen prime , Sophie Germain prime , cousin prime .
113,379,904 = 106482 = 4843 = 226
115,856,201 = 415
119,481,296 = logarithmic number[4]
120,528,657 = number of centered hydrocarbons with 27 carbon atoms[5]
121,242,121 = 110112 , palindromic square
122,522,400 = least number
m
{\displaystyle m}
such that
σ
(
m
)
m
>
5
{\displaystyle {\frac {\sigma (m )}{m}}>5}
, where
σ
(
m
)
{\displaystyle \sigma (m )}
= sum of divisors of m[6]
123,454,321 = 111112 , palindromic square
123,456,789 = smallest zeroless base 10 pandigital number
125,686,521 = 112112 , palindromic square
126,390,032 = number of 34-bead necklaces (turning over is allowed) where complements are equivalent[7]
126,491,971 = Leonardo prime[8]
129,140,163 = 317
129,145,076 = Leyland number[9]
129,644,790 = Catalan number [10]
130,150,588 = number of 33-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[11]
130,691,232 = 425
134,217,728 = 5123 = 89 = 227
134,218,457 = Leyland number[9]
134,219,796 = number of 32-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple 32-stage cycling shift register; also number of binary irreducible polynomials whose degree divides 32[12]
136,048,896 = 116642 = 1084
139,854,276 = 118262 , the smallest zeroless base 10 pandigital square
142,547,559 = Motzkin number [13]
147,008,443 = 435
148,035,889 = 121672 = 5293 = 236
157,115,917 – number of parallelogram polyominoes with 24 cells.[14]
157,351,936 = 125442 = 1124
164,916,224 = 445
165,580,141 = Fibonacci number
167,444,795 = cyclic number in base 6
170,859,375 = 157
171,794,492 = number of reduced trees with 36 nodes[15]
177,264,449 = Leyland number[9]
179,424,673 = 10,000,000th prime number
184,528,125 = 455
185,794,560 = double factorial of 18
188,378,402 = number of ways to partition {1,2,...,11} and then partition each cell (block) into subcells.[16]
190,899,322 = Bell number [17]
191,102,976 = 138242 = 5763 = 246
192,622,052 = number of free 18-ominoes
199,960,004 = number of surface-points of a tetrahedron with edge-length 9999[18]
200,000,000 to 299,999,999
[ edit ]
200,000,002 = number of surface-points of a tetrahedron with edge-length 10000[18]
205,962,976 = 465
210,295,326 = Fine number
211,016,256 = number of primitive polynomials of degree 33 over GF(2 )[19]
212,890,625 = 1-automorphic number [20]
214,358,881 = 146412 = 1214 = 118
222,222,222 = repdigit
222,222,227 = safe prime
223,092,870 = the product of the first nine prime numbers , thus the ninth primorial
225,058,681 = Pell number [21]
225,331,713 = self-descriptive number in base 9
229,345,007 = 475
232,792,560 = superior highly composite number ;[22] colossally abundant number ;[23] smallest number divisible by the numbers from 1 to 22
240,882,152 = number of signed trees with 16 nodes[24]
244,140,625 = 156252 = 1253 = 256 = 512
244,389,457 = Leyland number[9]
244,330,711 = n such that n | (3 n + 5)[25]
245,492,244 = number of 35-bead necklaces (turning over is allowed) where complements are equivalent[7]
252,648,992 = number of 34-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[11]
253,450,711 = Wedderburn-Etherington prime[3]
254,803,968 = 485
260,301,176 = number of 33-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple 33-stage cycling shift register; also number of binary irreducible polynomials whose degree divides 33[26]
267,914,296 = Fibonacci number
268,435,456 = 163842 = 1284 = 167 = 414 = 228
268,436,240 = Leyland number[9]
268,473,872 = Leyland number[9]
272,400,600 = the number of terms of the harmonic series required to pass 20
275,305,224 = the number of magic squares of order 5, excluding rotations and reflections
279,793,450 = number of trees with 26 unlabeled nodes[27]
282,475,249 = 168072 = 495 = 710
292,475,249 = Leyland number[9]
300,000,000 to 399,999,999
[ edit ]
308,915,776 = 175762 = 6763 = 266
309,576,725 = number of centered hydrocarbons with 28 carbon atoms[5]
312,500,000 = 505
321,534,781 = Markov prime
331,160,281 = Leonardo prime[8]
333,333,333 = repdigit
336,849,900 = number of primitive polynomials of degree 34 over GF(2 )[19]
345,025,251 = 515
350,238,175 = number of reduced trees with 37 nodes[15]
362,802,072 – number of parallelogram polyominoes with 25 cells[14]
364,568,617 = Leyland number[9]
365,496,202 = n such that n | (3 n + 5)[25]
367,567,200 = colossally abundant number ,[23] superior highly composite number [28]
380,204,032 = 525
381,654,729 = the only polydivisible number that is also a zeroless pandigital number
387,420,489 = 196832 = 7293 = 276 = 99 = 318 and in tetration notation 2 9
387,426,321 = Leyland number[9]
400,000,000 to 499,999,999
[ edit ]
400,080,004 = 200022 , palindromic square
400,763,223 = Motzkin number[13]
404,090,404 = 201022 , palindromic square
404,204,977 = number of prime numbers having ten digits[29]
405,071,317 = 11 + 22 + 33 + 44 + 55 + 66 + 77 + 88 + 99
410,338,673 = 177
418,195,493 = 535
429,981,696 = 207362 = 1444 = 128 = 100,000,00012 AKA a gross-great-great-gross (10012 great-great-grosses)
433,494,437 = Fibonacci prime , Markov prime
442,386,619 = alternating factorial [30]
444,101,658 = number of (unordered, unlabeled) rooted trimmed trees with 27 nodes[31]
444,444,444 = repdigit
455,052,511 = number of primes under 1010
459,165,024 = 545
467,871,369 = number of triangle-free graphs on 14 vertices[32]
477,353,376 = number of 36-bead necklaces (turning over is allowed) where complements are equivalent[7]
477,638,700 = Catalan number[10]
479,001,599 = factorial prime [33]
479,001,600 = 12!
481,890,304 = 219522 = 7843 = 286
490,853,416 = number of 35-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[11]
499,999,751 = Sophie Germain prime
500,000,000 to 599,999,999
[ edit ]
503,284,375 = 555
505,294,128 = number of 34-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple 34-stage cycling shift register; also number of binary irreducible polynomials whose degree divides 34[34]
522,808,225 = 228652 , palindromic square
535,828,591 = Leonardo prime[8]
536,870,911 = third composite Mersenne number with a prime exponent
536,870,912 = 229
536,871,753 = Leyland number[9]
542,474,231 = k such that the sum of the squares of the first k primes is divisible by k.[35]
543,339,720 = Pell number[21]
550,731,776 = 565
554,999,445 = a Kaprekar constant for digit length 9 in base 10
555,555,555 = repdigit
574,304,985 = 19 + 29 + 39 + 49 + 59 + 69 + 79 + 89 + 99 [36]
575,023,344 = 14-th derivative of xx at x=1[37]
594,823,321 = 243892 = 8413 = 296
596,572,387 = Wedderburn-Etherington prime[3]
600,000,000 to 699,999,999
[ edit ]
601,692,057 = 575
612,220,032 = 187
617,323,716 = 248462 , palindromic square
635,318,657 = the smallest number that is the sum of two fourth powers in two different ways (59 4 + 1584 = 1334 + 1344 ), of which Euler was aware.
644,972,544 = 8643 , 3-smooth number
654,729,075 = double factorial of 19
656,356,768 = 585
666,666,666 = repdigit
670,617,279 = highest stopping time integer under 109 for the Collatz conjecture
700,000,000 to 799,999,999
[ edit ]
701,408,733 = Fibonacci number
714,924,299 = 595
715,497,037 = number of reduced trees with 38 nodes[15]
715,827,883 = Wagstaff prime ,[38] Jacobsthal prime
725,594,112 = number of primitive polynomials of degree 36 over GF(2 )[19]
729,000,000 = 270002 = 9003 = 306
742,624,232 = number of free 19-ominoes
751,065,460 = number of trees with 27 unlabeled nodes[39]
774,840,978 = Leyland number[9]
777,600,000 = 605
777,777,777 = repdigit
778,483,932 = Fine number
780,291,637 = Markov prime
787,109,376 = 1-automorphic number [20]
797,790,928 = number of centered hydrocarbons with 29 carbon atoms[5]
800,000,000 to 899,999,999
[ edit ]
810,810,000 = smallest number with exactly 1000 factors
815,730,721 = 138
815,730,721 = 1694
835,210,000 = 1704
837,759,792 – number of parallelogram polyominoes with 26 cells.[14]
844,596,301 = 615
855,036,081 = 1714
875,213,056 = 1724
887,503,681 = 316
888,888,888 – repdigit
893,554,688 = 2-automorphic number [40]
893,871,739 = 197
895,745,041 = 1734
900,000,000 to 999,999,999
[ edit ]
906,150,257 = smallest counterexample to the Polya conjecture
916,132,832 = 625
923,187,456 = 303842 , the largest zeroless pandigital square
928,772,650 = number of 37-bead necklaces (turning over is allowed) where complements are equivalent[7]
929,275,200 = number of primitive polynomials of degree 35 over GF(2 )[19]
942,060,249 = 306932 , palindromic square
981,706,832 = number of 35-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple 35-stage cycling shift register; also number of binary irreducible polynomials whose degree divides 35[41]
987,654,321 = largest zeroless pandigital number
992,436,543 = 635
997,002,999 = 9993 , the largest 9-digit cube
999,950,884 = 316222 , the largest 9-digit square
999,961,560 = largest triangular number with 9 digits and the 44,720th triangular number
999,999,937 = largest 9-digit prime number
999,999,999 = repdigit
References
[ edit ]
^ a b c Sloane, N. J. A. (ed.). "Sequence A001190 (Wedderburn-Etherington numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002104 (Logarithmic numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c Sloane, N. J. A. (ed.). "Sequence A000022 (Number of centered hydrocarbons with n atoms)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A134716 (least number m such that sigma(m )/m > n, where sigma(m ) is the sum of divisors of m)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c d 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.
^ a b c Sloane, N. J. A. (ed.). "Sequence A145912 (Prime Leonardo numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c d e f g h i j k Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers: 3, together with numbers expressible as n^k + k^n nontrivially, i.e., n,k > 1 (to avoid n = (n-1)^1 + 1^(n-1)))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A000108 (Catalan numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c 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.
^ Sloane, N. J. A. (ed.). "Sequence A000031 (Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c Sloane, N. J. A. (ed.). "Sequence A006958 (Number of parallelogram polyominoes with n cells (also called staircase polyominoes, although that term is overused))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ 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.
^ Sloane, N. J. A. (ed.). "Sequence A000110 (Bell or exponential numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b c d 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.
^ a b Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002201 (Superior highly composite numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A004490 (Colossally abundant numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000060 (Number of signed trees with n nodes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ a b Sloane, N. J. A. (ed.). "Sequence A277288 (Positive integers n such that n divides (3^n + 5))" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000031 (Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002201 (Superior highly composite numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A006879 (Number of primes with n digits)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A002955 (Number of (unordered, unlabeled) rooted trimmed trees with n nodes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A006785 (Number of triangle-free graphs on n vertices)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A088054 (Factorial primes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000031 (Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ 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.
^ Sloane, N. J. A. (ed.). "Sequence A031971 (Sum_{1..n} k^n)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A005727 (n-th derivative of x^x at x equals 1. Also called Lehmer-Comtet numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000979 (Wagstaff primes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A030984 (2-automorphic numbers)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
^ Sloane, N. J. A. (ed.). "Sequence A000031 (Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n)" . The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
t
e
Examples in numerical order
Expression methods
Related articles (alphabetical order)
t
e
100,000
1,000,000
10,000,000
100,000,000
1,000,000,000
R e t r i e v e d f r o m " https://en.wikipedia.org/w/index.php?title=100,000,000&oldid=1236032320 "
C a t e g o r i e s :
● I n t e g e r s
● L a r g e n u m b e r s
● P o w e r s o f t e n
H i d d e n c a t e g o r i e s :
● A r t i c l e s w i t h s h o r t d e s c r i p t i o n
● S h o r t d e s c r i p t i o n m a t c h e s W i k i d a t a
● A r t i c l e s c o n t a i n i n g s i m p l i f i e d C h i n e s e - l a n g u a g e t e x t
● A r t i c l e s c o n t a i n i n g t r a d i t i o n a l C h i n e s e - l a n g u a g e t e x t
● A r t i c l e s c o n t a i n i n g C h i n e s e - l a n g u a g e t e x t
● A r t i c l e s c o n t a i n i n g K o r e a n - l a n g u a g e t e x t
● A r t i c l e s c o n t a i n i n g J a p a n e s e - l a n g u a g e t e x t
● T h i s p a g e w a s l a s t e d i t e d o n 2 2 J u l y 2 0 2 4 , a t 1 4 : 2 5 ( U T C ) .
● T e x t i s a v a i l a b l e u n d e r t h e C r e a t i v e C o m m o n s A t t r i b u t i o n - S h a r e A l i k e L i c e n s e 4 . 0 ;
a d d i t i o n a l t e r m s m a y a p p l y . B y u s i n g t h i s s i t e , y o u a g r e e t o t h e T e r m s o f U s e a n d P r i v a c y P o l i c y . W i k i p e d i a ® i s a r e g i s t e r e d t r a d e m a r k o f t h e W i k i m e d i a F o u n d a t i o n , I n c . , a n o n - p r o f i t o r g a n i z a t i o n .
● P r i v a c y p o l i c y
● A b o u t W i k i p e d i a
● D i s c l a i m e r s
● C o n t a c t W i k i p e d i a
● C o d e o f C o n d u c t
● D e v e l o p e r s
● S t a t i s t i c s
● C o o k i e s t a t e m e n t
● M o b i l e v i e w