Jakarta Aktual
Jakarta Aktual

Berita Aktual dan Faktual

Jakarta Aktual
Jakarta Aktual© 2026
Jakarta Aktual
Jakarta Aktual

Berita Aktual dan Faktual

Kembali ke Wiki
Artikel Wikipedia

1.000.000

1.000.000, satu juta, atau seribu ribu (Bahasa Inggris: one million). adalah Bilangan asli sesudah 999,999 dan bilangan asli sebelum 1,000,001. Bilangan Juta dalam bahasa Indonesia dikenal juga sebagai sejuta, Jt atau 1,000k. Dalam Notasi ilmiah, bilangan ini biasa direpresentasikan sebagai 106, untuk mempersingkat penulisan.

bilangan asli
Diperbarui 21 Maret 2026

Sumber: Lihat artikel asli di Wikipedia

1.000.000
← 999999 1000000 1000001 →
Daftar angka — Bilangan bulat
← 0 101 102 103 104 105 106 107 108 109
Kardinalsatu juta
Ordinalke-1.000.000
RomawiM
Biner111101000010010000002
Ternari12122102020013
Kuaternari33100210004
Quinary2240000005
Senary332333446
Oktal36411008
Duodesimal40285412
HeksadesimalF424016
Vigesimal6500020
Basis 36LFLS36
angka mesir𓁨
Visualisasi kelipatan sepuluh dari 1 hingga 1 juta

1.000.000, satu juta, atau seribu ribu (Bahasa Inggris: one million).[a] adalah Bilangan asli sesudah 999,999 dan bilangan asli sebelum 1,000,001. Bilangan Juta dalam bahasa Indonesia dikenal juga sebagai sejuta, Jt atau 1,000k. Dalam Notasi ilmiah, bilangan ini biasa direpresentasikan sebagai 106,[12] untuk mempersingkat penulisan.

Membayangkan Besar Bilangan Ini

Lihat entri juta di kamus bebas Wikikamus.

Menghitung bilangan ini secara manual adalah kegiatan yang sangat membosankan dan melelahkan, karena membutuhkan waktu dan konsentrasi yang tinggi. Namun ada banyak cara untuk memvisualisasikan bilangan dengan hampir akurat.

  • Informasi: Tidak termasuk Spasi, teks yang dicetak pada 136 halaman Encyclopædia Britannica, atau 600 halaman buku fiksi tebal berisi sekitar satu juta huruf, angka dan tanda baca.
  • Panjang: Ada satu juta milimeter dalam satu kilometer. Ban mobil meliliki kemungkinan untuk dapat berputar satu juta kali dalam perjalanan sejauh 1.900 kilometer (1.200 mil), pada saat yang sama Speedometer telah berputar beberapa periode.
  • Jari: Jika lebar jari manusia adalah sepanjang 22 mm , maka satu juta jari yang dijejerkan akan memiliki panjang 22 km. Jika seseorang berjalan dengan kecepatan 4 km/jam, maka mereka membutuhkan waktu sekitar lima setengah jam untuk mencapai ujung jajaran jari tersebut.
  • Volume: Akar pangkat tiga dari satu juta adalah seratus. Satu juta butir garam dapur atau gula pasir menempati sekitar 64 mL atau seperempat cangkir.
  • Massa: Satu juta milimeter kubik (tetesan kecil) air akan memiliki volume satu liter dan massa satu kilogram.
  • Berat: Satu juta lebah madu seberat 80 miligram (1,2 gram) memiliki berat yang sama dengan berat badan manusia seberat 80 kg.
  • Lanskap: Sebuah bukit piramida dengan lebar 600 kaki (180 m) di bagian dasar dan tinggi 100 kaki (30 m) akan memiliki berat sekitar satu juta ton.
  • Komputer: Resolusi layar 1.280 x 800 piksel berisi 1.024.000 piksel.
  • Uang: Satu lembar uang dolar AS dengan pecahan apa pun memiliki berat 1 gram (0,035 ons). Ada 454 gram dalam satu pon. Satu juta lembar uang kertas dolar memiliki berat 1 megagram (1.000 kg) atau 1 ton (lebih dari 1 ton).
  • Waktu: Satu juta detik adalah setara dengan 11,57 hari.
Satu juta titik hitam yang mengisi setiap piksel – (gambar penuh)

Bilangan 7 digit (1.000.000-9.999.999) penting

1.000.001 sampai 1.999.999

  • 1.000.003 = Bilangan prima 7 digit terkecil
  • 1.000.405 = Bilangan segitiga dengan 7 digit terkecil, sekaligus merupakan bilangan segitiga ke 1.414.
  • 1.002.001 = 10012, bilangan palindrom
  • 1.006.301 =Bilangan pertama dari pasangan pertama kembar empat prima yang muncul dengan jarak tiga puluh ({1006301, 1006303, 1006307, 1006309} dan {1006331, 1006333, 1006337, 1006339})[13]
  • 1.024.000 = jumlah bit dalam Megabita[14]
  • 1.030.301 = 1013, palindromic cube
  • 1.037.718 = bilangan Schröder besar
  • 1.048.576 = 10242 = 324 = 165 = 410 = 220, jumlah bytes dalam mebibyte (dulu disebut megabyte)
  • 1.048.976 = Bilangan Leyland 7 deigit terkecil
  • 1.058.576 = Bilangan Leyland
  • 1,058,841 = 76 x 32
  • 1.077.871 = jumlah Bilangan prima di antara 0 sampai 16777216 (224)
  • 1.084.051 = Bilangan Keith ke lima[15]
  • 1.089.270 = bilangan pembagi harmonik[16]
  • 1.111.111 = repunit
  • 1.112.083 = angka logaritmik[17]
  • 1.129.30832 + 1 adalah bilangan prima[18]
  • 1.136.689 = Bilangan Pell.[19] Bilangan Markov[20]
  • 1.174.281 = Bilangan Baik[21]
  • 1.185.921 = 10892 = 334
  • 1.200.304 = 17 + 27 + 37 + 47 + 57 + 67 + 77 [22]
  • 1.203.623 = bilangan tak prima terkecil yang berakhiran 3[23][24]
  • 1.234.321 = 11112, bilangan palindrom
  • 1.246.863 = Jumlah kalung 27 manik (boleh dibalik) yang memiliki pelengkap yang setara[25]
  • 1.256.070 = jumlah pohon yang direduksi dengan 29 simpul[26]
  • 1.262.180 = jumlah graf bebas segitiga pada 12 simpul[27]
  • 1.278.818 = Markov number[20]
  • 1.290.872 = Jumlah kalung 27 manik-manik (boleh dibalik) yang jumlah pelengkapnya ekuivalen[28]
  • 1.296.000 = jumlah pohon tereduksi dengan 29 GF(2)[29]
  • 1.299.709 = Bilangan prima ke-100.000
  • 1.336.336 = 11562 = 344
  • 1.346.269 = Bilangan Fibonacci.[30] Markov number[20]
  • 1.367.631 = 1113, kubus palindrom
  • 1.388.705 = jumlah simpul utama dengan 16 sebrangan
  • 1.413.721 = Bilangan segitiga kuadrat[31]
  • 1.419.857 = 175
  • 1.421.280 = bilangan pembagi harmonik[16]
  • 1.441.440 = [[en

abundant number|bilangan yang sangat berlimpah]].[32] [[en highly composite number|angka komposit yang sangat tinggi]][33]

  • 1.441.889 = Markov number[20]
  • 1.500.625 = 12252 = 354
  • 1.539.720 = bilangan pembagi harmonik[16]
  • 1.563.372 = Bilangan Wedderburn-Etherington[34]
  • 1.594.323 = 313
  • 1.596.520 = Bilangan Leyland
  • 1.606.137 = jumlah cara untuk membagi {1,2,3,4,5,6,7,8,9} dan kemudian membagi setiap sel (blok) ke dalam subsel.[35]
  • 1.607.521/1.136.689 ≈ √2
  • 1.647.086 = Bilangan Leyland
  • 1.671.800 = Angka awal abad pertama xx00 hingga xx99 seluruhnya terdiri dari Bilangan komposit[36]
  • 1.679.616 = 12962 = 364 = 68
  • 1.686.049 = Markov prime
  • 1.687.989 = jumlah matriks bujur sangkar (0.1) tanpa baris nol dan dengan tepat 7 entri sama dengan 1[37]
  • 1.719.900 = jumlah polinomial primitif berderajat 26 di atas GF(2)[29]
  • 1.730.787 = Bilangan Riordan
  • 1.741.725 = sama dengan jumlah pangkat ketujuh dari angka-angkanya
  • 1.771.561 = 13312 = 1213 = 116. Juga, perkiraan Komandan Spock untuk populasi tribble di Star Trek episode "The Trouble with Tribbles"
  • 1.864.637 = k sedemikian hingga jumlah kuadrat dari k bilangan prima pertama habis dibagi oleh k.[38]
  • 1.874.161 = 13692 = 374
  • 1.889.568 = 185
  • 1.928.934 = 2 x 39 x 72
  • 1.941.760 = Bilangan Leyland
  • 1.953.125 = 1253 = 59
  • 1.978.405 = 16 + 26 + 36 + 46 + 56 + 66 + 76 + 86 + 96 + 106 [39]

2.000.000 hingga 2.999.999

  • 2.000.002 = jumlah titik permukaan sebuah tetrahedron dengan panjang sisi 1000[40]
  • 2.000.376 = 1263
  • 2.012.174 = Bilangan Leyland
  • 2.012.674 = Bilangan Markov[20]
  • 2.027.025 = faktorial ganda dari 15
  • 2.085.136 = 14442 = 384
  • 2.097.152 = 1283 = 87 = 221
  • 2.097.593 = Bilangan prima Leyland[41]
  • 2.118.107 = bilangan bulat terbesar n ≤ 10 10 {\displaystyle n\leq 10^{10}} {\displaystyle n\leq 10^{10}} sehingga ∑ k = 0 22 ω ( n + k ) ≤ 57 {\displaystyle \sum _{k=0}^{22}\omega (n+k)\leq 57} {\displaystyle \sum _{k=0}^{22}\omega (n+k)\leq 57}, di mana ω ( n ) {\displaystyle \omega (n)} {\displaystyle \omega (n)} adalah fungsi omega prima untuk faktor prima yang berbeda. Jumlah yang bersesuaian untuk 2.118.107 memang 57.
  • 2.124.679 = Bilangan prima Wolstenholme terbesar yang diketahui
  • 2.144.505 = jumlah pohon dengan 21 simpul tanpa label
  • 2.177.399 = bilangan pandigital terkecil dalam basis 8
  • 2.178.309 = Bilangan Fibonacci[30]
  • 2.222.222 = repdigit
  • 2.266.502 = jumlah pohon bertanda dengan 13 simpul[42]
  • 2.274.205 = jumlah cara berbeda untuk menyatakan 1.000.000.000 sebagai jumlah dua bilangan prima[43]
  • 2.313.441 = 15212 = 394
  • 2.356.779 = Bilangan Motzkin[44]
  • 2.405.236 = Jumlah kalung dengan 28 manik (boleh dibalik) di mana pelengkapnya setara[25]
  • 2.423.525 = Bilangan Markov[20]
  • 2.476.099 = 195
  • 2.485.534 = jumlah kalung biner dengan 27 manik dan dua warna di mana warnanya dapat dipertukarkan, tetapi tidak boleh dibalik[28]
  • 2.515.169 = jumlah pohon tereduksi dengan 30 simpul[26]
  • 2.560.000 = 16002 = 404
  • 2.567.284 = jumlah set yang diurutkan sebagian dengan 10 elemen tanpa label[45]
  • 2.646.723 = bilangan Schroeder kecil
  • 2.674.440 = Bilangan Catalan[46]
  • 2.692.537 = Bilangan prima Leonardo
  • 2.704.900 = jumlah awal dari abad keempat xx00 hingga xx99 yang mengandung tujuh belas bilangan prima[47][b] {2.704.901, 2.704.903, 2.704.907, 2.704.909, 2.704.927, 2.704.931, 2.704.937, 2.704.939, 2.704.943, 2.704.957, 2.704.963, 2.704.969, 2.704.979, 2.704.981, 2.704.987, 2.704.993, 2.704.997}
  • 2.744.210 = Bilangan Pell[19]
  • 2.796.203 = Bilangan prima Wagstaff,[50] Bilangan prima Jacobsthal
  • 2.825.761 = 16812 = 414
  • 2.890.625 = bilangan automorfik 1[51]
  • 2.922.509 = Bilangan prima Markov
  • 2.985.984 = 17282 = 1443 = 126 = 1.000.00012 AKA a great-great-gross

3.000.000 sampai 3.999.999

  • 3.111.696 = 17642 = 424
  • 3.200.000 = 205
  • 3.263.442 = hasil kali lima suku pertama dari Deret Sylvester
  • 3.263.443 = suku keenam dari Deret Sylvester[52]
  • 3.276.509 = bilangan prima Markov
  • 3.294.172 = 22×77[53]
  • 3.301.819 = faktorial bergantian[54]
  • 3.333.333 = repdigit
  • 3.360.633 = palindromik dalam 3 basis berturut-turut: 62818269 = 336063310 = 199599111
  • 3.418.801 = 18492 = 434
  • 3.426.576 = jumlah dari 15-omino bebas
  • 3.524.578 = bilangan Fibonacci,[30] bilangan Markov[20]
  • 3.554.688 = bilangan 2-otomorfik[55]
  • 3.626.149 = bilangan prima Wedderburn–Etherington[34]
  • 3.628.800 = 10!
  • 3.748.096 = 19362 = 444
  • 3.880.899/2.744.210 ≈ √2

Catatan

  1. ↑ Referensi bilangan ini diambil dari kamus bahasa indonesia dan bahasa inggris yang diterjemahkan ke bahasa indonesia. Sumber internal:KBBI Daring,[1] KUBI,[2] KMBI[3] Sumber luar: AHD4[4] CED[5] COD[6] OED2[7] OEDweb[8] RHD2[9] SOED3[10] dan W3[11]
  2. ↑ Tidak ada abad yang mengandung lebih dari tujuh belas prima antara 200 dan 122.853.771.370.899 inklusif,[48] dan tidak ada yang mengandung lebih dari lima belas antara 2.705.000 dan 839.296.299 inklusif.[49]

Referensi

\n{{Cite web\n |last=Pengembangan dan Pembinaan Bahasa\n |first=Badan\n |title=KBBI Daring\n |url=https://kbbi.kemdikbud.go.id/\n |website=KBBI Daring\n |language=Indonesia\n |isbn=978-979-22-3841-9\n |access-date=22 September 2024|\n edition=IV\n}}\n</ref>\n<ref name=superskrip>\n{{cite book \n |author=David Wells \n |title=The Penguin Dictionary of Curious and Interesting Numbers\n |location=London \n |publisher=Penguin Group \n |year=1987\n |page=185 \n |quote=1,000,000 = 10<sup>6</sup>\n}}\n</ref>\n<ref name=ahdel>\n{{cite book\n | title=The American Heritage Dictionary of the English Language\n | year=2000\n | publisher=Houghton Mifflin\n | isbn=0-395-82517-2\n | edition=4\n | url=https://archive.org/details/americanheritage0000unse_a1o7\n | url-access=registration\n}}\n</ref>\n<ref name=collins>\n{{cite web\n | title=Collins English Dictionary\n | publisher=HarperCollins\n | url=https://www.collinsdictionary.com/\n}}\n</ref>\n\n<ref name=cambridge>\n{{cite web\n | title=Cambridge Dictionaries Online\n | publisher=Cambridge University Press\n | url=http://dictionary.cambridge.org/\n}}\n</ref>\n\n<ref name=oed_2>\n{{cite book\n | title=The Oxford English Dictionary\n | year=1991\n | edition=2nd\n | publisher=Clarendon Press\n | isbn=0-19-861186-2\n | url=https://books.google.com/books?id=dpIwuwEACAAJ\n}}\n</ref>\n\n<ref name=oed_web>\n{{cite web\n | title=Oxford English Dictionary\n | publisher=Oxford University Press\n | url=http://www.oed.com\n | url-access=subscription\n}}\n</ref>\n\n<ref name=random>\n{{cite book\n | title=The Random House Dictionary of the English Language\n | publisher=Random House\n | year=1987\n | edition=2nd\n | isbn=\n}}\n</ref>\n\n<ref name=nsoed>\n{{cite book\n | title=The New Shorter Oxford English Dictionary\n | publisher=Oxford University Press\n | first1=Lesley\n | last1=Brown\n | first2=William\n | last2=Little\n | year=1993\n | isbn=0198612710\n | url=https://books.google.com/books?id=UCzGvQEACAAJ\n}}\n</ref>\n\n<ref name=webster>\n{{cite book\n | title=Webster's Third New International Dictionary of the English Language, Unabridged\n | first1=Noah\n | last1=Webster\n | publisher=Merriam-Webster\n | year=1981\n | isbn=0877792011\n | url=https://books.google.com/books?id=CXR-tTsHo58C\n}}\n</ref>\n\n<ref name=KUBI>\n{{Citebook\n |last=Poewadarminta\n |first=W.J.S.|\n date=2006\n |url=https://pustaka.pu.go.id/biblio/kamus-umum-bahasa-indonesia-edisi-ketiga/EJ67E\n |title=Kamus Umum Bahasa Indonesia\n |publisher=Balai Pustaka\n |url-status=live\n}}\n</ref>\n\n<ref name=KMBI>\n{{Citebook\n |last=Zain\n |first=Sutan Mohammad\n |url=https://opac.perpusnas.go.id/DetailOpac.aspx?id=830649\n |title=Kamus Moderen Bahasa Indonesia\n |publisher=Grafica Djakarta\n |url-status=live}}\n</ref>\n\n<ref name=pemula>{{\nCite OEIS\n |A059925\n |Initial members of two prime quadruples (A007530) with the smallest possible difference of 30\n}}\n</ref>\n\n<ref name=megabyte>[http://www.computernostalgia.net/articles/HistoryoftheFloppyDisk.htm Tracing the History of the Computer - History of the Floppy Disk]\n</ref>\n\n<ref name=A007629>{{Cite OEIS\n |A007629\n |Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers)}}\n</ref>\n\n<ref name=A001599>\n{{Cite OEIS\n |A001599\n |Harmonic or Ore numbers}}\n</ref>\n\n<ref name=expansion>{{cite OEIS\n |A000258\n |Expansion of e.g.f. exp(exp(exp(x)-1)-1)}}\n</ref>\n\n<ref name=A004490>\n{{Cite OEIS \n |A004490\n |Colossally abundant numbers}}\n</ref>\n\n<ref name=A002104>\n{{cite OEIS\n |A002104\n |Logarithmic numbers}}\n</ref>\n\n<ref name=A006315>\n{{cite OEIS\n |A006315\n |Numbers n such that n^32 + 1 is prime}}\n</ref>\n\n<ref name=A000129>{{Cite OEIS\n |A000129\n |Pell numbers}}\n</ref>\n\n<ref name=A002559>{{Cite OEIS\n |A002559\n |2=Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x^2 + y^2 + z^2 = 3*x*y*z}}\n</ref>\n\n<ref name=A000957>{{cite OEIS\n |A000957\n |Fine's sequence (or Fine numbers): number of relations of valence > 0 on an n-set; also number of ordered rooted trees with n edges having root of even degree}}\n</ref>\n<ref name=julia>{{Cite book\n |last=Collins\n |first=Julia\n |title=Numbers in Minutes\n |url=https://archive.org/details/numbersinminutes0000juli\n |publisher=Quercus\n |year=2019\n |isbn=978-1635061772\n |location=United Kingdom\n |pages=[https://archive.org/details/numbersinminutes0000juli/page/n141 140]}}\n</ref>\n\n<ref name=A031971>\n{{cite OEIS\n |A031971\n |Sum_{1..n} k^n}}\n</ref>\n\n<ref name=A143641>{{Cite OEIS\n |A143641\n |Odd prime-proof numbers not ending in 5}}\n</ref>\n\n<ref name=A000011>{{cite OEIS\n |A000011\n |Number of n-bead necklaces (turning over is allowed) where complements are equivalent}}\n</ref>\n\n<ref name=A000014>{{cite OEIS\n |A000014\n |Number of series-reduced trees with n nodes}}\n</ref>\n\n<ref name=A006785>{{cite OEIS\n |A006785\n |Number of triangle-free graphs on n vertices}}\n</ref>\n\n<ref name=A000013>{{cite OEIS\n |A000013\n |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}}</ref>\n \n<ref name=A011260>{{cite OEIS\n |A011260\n |Number of primitive polynomials of degree n over GF(2)}}\n</ref>\n\n<ref name=A000045>{{Cite OEIS\n |A000045\n |Fibonacci numbers}}\n</ref>\n\n<ref name=A181098>{{Cite OEIS\n |A181098\n |Primefree centuries}}\n</ref>\n\n<ref name=A005893>\n{{cite OEIS\n |A005893\n |Number of points on surface of tetrahedron}}\n</ref>\n\n<ref name=A094133>\n{{Cite OEIS|A094133|Leyland primes}}\n</ref>\n\n<ref name=A000060>{{cite OEIS\n |A000060\n |Number of signed trees with n nodes}}</ref>\n\n<ref name=A065577>{{Cite OEIS\n |A065577\n |Number of Goldbach partitions of 10^n}}</ref>\n<ref name=A001110>{{Cite OEIS|A001110|Square triangular numbers}}</ref><ref name=A002201>{{Cite OEIS|A002201|Superior highly composite numbers}}</ref>\n<ref name=A001190>{{Cite OEIS|A001190|Wedderburn-Etherington numbers}}</ref>\n<ref name=A122400>{{cite OEIS|A122400|Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1}}</ref>\n<ref name=A111441>{{cite OEIS|A111441|Numbers k such that the sum of the squares of the first k primes is divisible by k}}</ref>\n<ref name=A001006>{{Cite OEIS|A001006|Motzkin numbers}}</ref>\n<ref name=A000112>{{cite OEIS|A000112|Number of partially ordered sets (posets) with n unlabeled elements}}</ref>\n<ref name=A000108>{{Cite OEIS|A000108|Catalan numbers}}</ref>\n<ref name=A186509>{{Cite OEIS|A186509|Centuries containing 17 primes}}</ref>\n<ref name=A186311>\n{{Cite OEIS|A186311|Least century 100k to 100k+99 with exactly ''n'' primes}}\n</ref> \nand none containing more than fifteen between 2,705,000 and 839,296,299 inclusive.<ref name=A186408>\n{{cite OEIS|A186408|Centuries containing 16 primes}}\n</ref>\n<ref name = automorphic>{{Cite OEIS|A003226|Automorphic numbers}}</ref>\n<ref name=A000979>{{Cite OEIS|A000979|Wagstaff primes}}</ref>"}},"i":0}}]}' id="mwAt8"/>
  1. ↑ Pengembangan dan Pembinaan Bahasa, Badan. "KBBI Daring". KBBI Daring (dalam bahasa Indonesia) (Edisi IV). ISBN 978-979-22-3841-9. Diakses tanggal 22 September 2024. Pemeliharaan CS1: Bahasa yang tidak diketahui (link)
  2. ↑ Poewadarminta, W.J.S. (2006). Kamus Umum Bahasa Indonesia. Balai Pustaka. Pemeliharaan CS1: Status URL (link)
  3. ↑ Zain, Sutan Mohammad. Kamus Moderen Bahasa Indonesia. Grafica Djakarta. Pemeliharaan CS1: Status URL (link)
  4. ↑ The American Heritage Dictionary of the English Language (Edisi 4). Houghton Mifflin. 2000. ISBN 0-395-82517-2.
  5. ↑ "Collins English Dictionary". HarperCollins.
  6. ↑ "Cambridge Dictionaries Online". Cambridge University Press.
  7. ↑ The Oxford English Dictionary (Edisi 2nd). Clarendon Press. 1991. ISBN 0-19-861186-2.
  8. ↑ "Oxford English Dictionary". Oxford University Press.
  9. ↑ The Random House Dictionary of the English Language (Edisi 2nd). Random House. 1987.
  10. ↑ Brown, Lesley; Little, William (1993). The New Shorter Oxford English Dictionary. Oxford University Press. ISBN 0198612710.
  11. ↑ Webster, Noah (1981). Webster's Third New International Dictionary of the English Language, Unabridged. Merriam-Webster. ISBN 0877792011.
  12. ↑ David Wells (1987). The Penguin Dictionary of Curious and Interesting Numbers. London: Penguin Group. hlm. 185. 1,000,000 = 106
  13. ↑ Sloane, N.J.A. (ed.). "Sequence A059925 (Initial members of two prime quadruples (A007530) with the smallest possible difference of 30)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  14. ↑ Tracing the History of the Computer - History of the Floppy Disk
  15. ↑ Sloane, N.J.A. (ed.). "Sequence A007629 (Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers))". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  16. 1 2 3 Sloane, N.J.A. (ed.). "Sequence A001599 (Harmonic or Ore numbers)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  17. ↑ Sloane, N.J.A. (ed.). "Sequence A002104 (Logarithmic numbers)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  18. ↑ Sloane, N.J.A. (ed.). "Sequence A006315 (Numbers n such that n^32 + 1 is prime)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  19. 1 2 Sloane, N.J.A. (ed.). "Sequence A000129 (Pell numbers)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  20. 1 2 3 4 5 6 7 Sloane, N.J.A. (ed.). "Sequence A002559 (Markoff (or Markov) numbers: union of positive integers x, y, z satisfying x^2 + y^2 + z^2 = 3*x*y*z)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  21. ↑ Sloane, N.J.A. (ed.). "Sequence A000957 (Fine's sequence (or Fine numbers): number of relations of valence > 0 on an n-set; also number of ordered rooted trees with n edges having root of even degree)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  22. ↑ Sloane, N.J.A. (ed.). "Sequence A031971 (Sum_{1..n} k^n)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  23. ↑ Collins, Julia (2019). Numbers in Minutes. United Kingdom: Quercus. hlm. 140. ISBN 978-1635061772.
  24. ↑ Sloane, N.J.A. (ed.). "Sequence A143641 (Odd prime-proof numbers not ending in 5)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  25. 1 2 Sloane, N.J.A. (ed.). "Sequence A000011 (Number of n-bead necklaces (turning over is allowed) where complements are equivalent)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  26. 1 2 Sloane, N.J.A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  27. ↑ Sloane, N.J.A. (ed.). "Sequence A006785 (Number of triangle-free graphs on n vertices)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  28. 1 2 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)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  29. 1 2 Sloane, N.J.A. (ed.). "Sequence A011260 (Number of primitive polynomials of degree n over GF(2))". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  30. 1 2 3 Sloane, N.J.A. (ed.). "Sequence A000045 (Fibonacci numbers)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  31. ↑ Sloane, N.J.A. (ed.). "Sequence A001110 (Square triangular numbers)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  32. ↑ Sloane, N.J.A. (ed.). "Sequence A004490 (Colossally abundant numbers)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  33. ↑ Sloane, N.J.A. (ed.). "Sequence A002201 (Superior highly composite numbers)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  34. 1 2 Sloane, N.J.A. (ed.). "Sequence A001190 (Wedderburn-Etherington numbers)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  35. ↑ Sloane, N.J.A. (ed.). "Sequence A000258 (Expansion of e.g.f. exp(exp(exp(x)-1)-1))". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  36. ↑ Sloane, N.J.A. (ed.). "Sequence A181098 (Primefree centuries)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  37. ↑ Sloane, N.J.A. (ed.). "Sequence A122400 (Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  38. ↑ 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)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  39. ↑ Sloane, N.J.A. (ed.). "Sequence A000540 (Sum of 6th powers: 0^6 + 1^6 + 2^6 + ... + n^6.)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  40. ↑ Sloane, N.J.A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  41. ↑ Sloane, N.J.A. (ed.). "Sequence A094133 (Leyland primes)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  42. ↑ Sloane, N.J.A. (ed.). "Sequence A000060 (Number of signed trees with n nodes)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  43. ↑ Sloane, N.J.A. (ed.). "Sequence A065577 (Number of Goldbach partitions of 10^n)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  44. ↑ Sloane, N.J.A. (ed.). "Sequence A001006 (Motzkin numbers)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  45. ↑ Sloane, N.J.A. (ed.). "Sequence A000112 (Number of partially ordered sets (posets) with n unlabeled elements)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  46. ↑ Sloane, N.J.A. (ed.). "Sequence A000108 (Catalan numbers)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  47. ↑ Sloane, N.J.A. (ed.). "Sequence A186509 (Centuries containing 17 primes)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  48. ↑ Sloane, N.J.A. (ed.). "Sequence A186311 (Least century 100k to 100k+99 with exactly n primes)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  49. ↑ Sloane, N.J.A. (ed.). "Sequence A186408 (Centuries containing 16 primes)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  50. ↑ Sloane, N.J.A. (ed.). "Sequence A000979 (Wagstaff primes)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  51. ↑ Sloane, N.J.A. (ed.). "Sequence A003226 (Automorphic numbers)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  52. ↑ Sloane, N.J.A. (ed.). "Sequence A000058 (Sylvester's sequence)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  53. ↑ Sloane, N.J.A. (ed.). "Sequence A048102 (Numbers k such that if k equals Product p_i^e_i then p_i equals e_i for all i)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  54. ↑ Sloane, N.J.A. (ed.). "Sequence A005165 (Alternating factorials)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  55. ↑ Sloane, N.J.A. (ed.). "Sequence A030984 (2-automorphic numbers)". On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
Basis data pengawasan otoritas Sunting di Wikidata
Nasional
  • Amerika Serikat
  • Republik Ceko
  • Israel
Lain-lain
  • Yale LUX

Bagikan artikel ini

Share:

Daftar Isi

  1. Membayangkan Besar Bilangan Ini
  2. Bilangan 7 digit (1.000.000-9.999.999) penting
  3. 1.000.001 sampai 1.999.999
  4. 2.000.000 hingga 2.999.999
  5. 3.000.000 sampai 3.999.999
  6. Catatan
  7. Referensi

Artikel Terkait

Bilangan asli

menangkapnya.Bilangan positif dilambangkan dengan tanda (+). Wajar apabila bilangan asli adalah jenis pertama dari bilangan yang digunakan untuk membilang, menghitung

Angka Korea

sistem bilangan Sino Korea (diadaptasi dari angka Tionghoa) dan sistem bilangan asli Korea. Bagi kedua nomor (bilangan asli Korea dan bilangan Sino Korea)

Bilangan

meliputi bilangan nol, bilangan negatif, bilangan rasional, bilangan irasional, dan bilangan kompleks. Prosedur-prosedur tertentu yang mengambil bilangan sebagai

Jakarta Aktual
Jakarta Aktual© 2026