100000000

100000000100000000

<< 10⁰‍ 10¹‍ 10²‍ 10³‍ 10⁴‍ 10⁵‍ 10⁶‍ 10⁷‍ 10⁸‍ 10⁹‍ >>
10000000 100000000 1000000000

命名小寫一億大寫壹億序數詞第一億
one hundred millionth識別種類整數性質質因數分解

2^{8}\times 5^{8}

表示方式值100000000算筹

希腊数字

{\stackrel {\alpha }{\mathrm {M} }}

羅馬數字

{\overline {\overline {\mathrm {C} }}}

二进制101111101011110000100000000₍₂₎三进制20222011112012201₍₃₎四进制11331132010000₍₄₎五进制201100000000₍₅₎八进制575360400₍₈₎十二进制295A6454₍₁₂₎十六进制5F5E100₍₁₆₎

100,000,000 （一亿）是99,999,999和100,000,001之间的自然数。

用科学记数法写成 10⁸ 。

东亚语言将“亿”作为一个计数单位，相当另一个计数单位“万”的平方。在韩文和日文中分别为 eok ( 억/億) 和oku (億）。

100,000,000是100的四次方，也是10000的平方。

值得注意的 9 位数字 (100,000,001–999,999,999)

100,000,001 至 199,999,999

100,000,007 = 最小的九位素数^[1]
100,005,153 = 最小的 9 位三角数和第 14,142 个三角数
100,020,001 = 10001², 回文平方
100,544,625 = 465³ ，最小的9位立方
102,030,201 = 10101²，回文平方
102,334,155 = 斐波那契数
102,400,000 = 40⁵
104,060,401 = 10201² = 101⁴ ，回文平方
105,413,504 = 14⁷
107,890,609 = 韦德伯恩-埃瑟林顿数^[2]
111,111,111 = 循環單位, 12345678987654321 的平方根
111,111,113 = 陈素数、苏菲杰曼素数、表弟素数。
113,379,904 = 10648² = 484³ = 22⁶
115,856,201 = 41⁵
119,481,296 = 对数^[3]
121,242,121 = 11011², 回文平方
123,454,321 = 11111², 回文平方
123,456,789 = 最小无零基 10 泛数字
125,686,521 = 11211², 回文平方
126,390,032 = 补数相等的 34 珠项链数量（允许翻转） ^[4]
126,491,971 = 莱昂纳多素数
129,140,163 = 3¹⁷
129,145,076 = 利兰数
129,644,790 = 加泰罗尼亚号码^[5]
130,150,588 = 33 珠二元项链的数量，有 2 种颜色的珠子，颜色可以互换，但不允许翻转^[6]
130,691,232 = 42⁵
134,217,728 = 512³ = 8⁹ = 2²⁷
134,218,457 = 利兰数
136,048,896 = 11664² = 108⁴
139,854,276 = 11826² ，最小无零底数 10 泛数字平方
142,547,559 = 莫茨金数^[7]
147,008,443 = 43⁵
148,035,889 = 12167² = 529³ = 23⁶
157,115,917 – 24 个单元的平行四边形多格骨牌的数量。 ^[8]
157,351,936 = 12544² = 112⁴
164,916,224 = 44⁵
165,580,141 = 斐波那契数
167,444,795 = 6 进制下的循环数
170,859,375 = 15⁷
171,794,492 = 具有 36 个节点的缩减树的数量^[9]
177,264,449 = 利兰数
179,424,673 = 第 10,000,000 个质数
184,528,125 = 45⁵
188,378,402 = 划分{1,2,...,11}然后将每个单元（块）划分为子单元的方式数。 ^[10]
190,899,322 = 贝尔数^[11]
191,102,976 = 13824² = 576³ = 24⁶
192,622,052 = 自由 18 格骨牌的数量
199,960,004 = 边长为 9999 的四面体的表面点数^[12]

200,000,000 至 299,999,999

200,000,002 = 边长为 10000 的四面体的表面点数^[12]
205,962,976 = 46⁵
210,295,326 = Fine's number
211,016,256 = GF(2) 上的 33 次本原多项式的数量^[13]
212,890,625 = 1-自守数^[14]
214,358,881 = 14641² = 121⁴ = 11⁸
222,222,222 = 純位數
222,222,227 = 安全素数
223,092,870 = 前九个素数的乘积，即第九个素数
225,058,681 = 佩尔数^[15]
225,331,713 = 以 9 为基数的自描述数字
229,345,007 = 47⁵
232,792,560 = 高级高合数； ^[16]可羅薩里過剩數； ^[17]可被 1 到 22 所有数字整除的最小数字
244,140,625 = 15625² = 125³ = 25⁶ = 5¹²
244,389,457 = 利兰数
244,330,711 = n 使得 n | (3ⁿ + 5)
245,492,244 = 补数相等的 35 珠项链数量（允许翻转） ^[4]
252,648,992 = 34 珠二元项链的数量，有 2 种颜色的珠子，颜色可以互换，但不允许翻转^[6]
253,450,711 = 韦德伯恩-埃瑟林顿素数^[2]
254,803,968 = 48⁵
267,914,296 = 斐波那契数
268,435,456 = 16384² = 128⁴ = 16⁷ = 4¹⁴ = 2²⁸
268,436,240 = 利兰数
268,473,872 = 利兰数
272,400,600 = 通过 20 所需的调和级数的项数
275,305,224 = 5 阶幻方的数量，不包括旋转和反射
282,475,249 = 16807² = 49⁵ = 7¹⁰
292,475,249 = 利兰数

300,000,000 至 399,999,999

308,915,776 = 17576² = 676³ = 26⁶
312,500,000 = 50⁵
321,534,781 = 马尔可夫素数
331,160,281 = 莱昂纳多素数
333,333,333 = 純位數
336,849,900 = GF(2) 上的 34 次本原多项式的数量^[13]
345,025,251 = 51⁵
350,238,175 = 具有 37 个节点的缩减树的数量^[9]
362,802,072 = 25 个单元的平行四边形多格骨牌数量^[8]
364,568,617 = 利兰数
365,496,202 = n 使得 n | (3ⁿ + 5)
367,567,200 = 可羅薩里過剩數，Superior highly composite number（英语：Superior highly composite number）
380,204,032 = 52⁵
381,654,729 = 唯一累进可除数，同时也是无零泛泛位数
387,420,489 = 19683² = 729³ = 27⁶ = 9⁹ = 3¹⁸，迭代幂次表示为 ²9
387,426,321 = 利兰数

400,000,000 至 499,999,999

400,080,004 = 20002², 回文平方
400,763,223 = 莫茨金数^[7]
404,090,404 = 20102², 回文平方
405,071,317 = 1¹ + 2² + 3³ + 4⁴ + 5⁵ + 6⁶ + 7⁷ + 8⁸ + 9⁹
410,338,673 = 17⁷
418,195,493 = 53⁵
429,981,696 = 20736² = 144⁴ = 12⁸ = 100,000,000 ₁₂又名gross-great-great-gross (100 ₁₂ Great-great-grosses)
433,494,437 = 斐波那契素数、马尔可夫素数
442,386,619 = 交替阶乘^[18]
444,101,658 = 具有 27 个节点的（无序、无标签）有根修剪树的数量^[19]
444,444,444 = 純位數
455,052,511 = 10以下的素数个数¹⁰
459,165,024 = 54⁵
467,871,369 = 14 个顶点上的无三角形图的数量^[20]
477,353,376 = 补数相等的 36 珠项链数量（允许翻转） ^[4]
477,638,700 = 加泰罗尼亚号码^[5]
479,001,599 = 阶乘质数^[21]
479,001,600 = 12！
481,890,304 = 21952² = 784³ = 28⁶
490,853,416 = 35 珠二元项链的数量，有 2 种颜色的珠子，颜色可以交换，但不允许翻转^[6]
499,999,751 = 苏菲·杰曼素数

500,000,000 至 599,999,999

503,284,375 = 55⁵
522,808,225 = 22865², 回文平方
535,828,591 = 莱昂纳多素数
536,870,911 = 第三个具有质数指数的复合梅森数
536,870,912 = 2²⁹
536,871,753 = 利兰数
542,474,231 = k 使得前 k 个素数的平方和可被 k 整除。 ^[22]
543,339,720 = 佩尔号^[15]
550,731,776 = 56⁵
554,999,445 = 以 10 为基数表示数字长度 9 的Kaprekar 常数
555,555,555 = 純位數
574,304,985 = 1⁹ + 2⁹ + 3⁹ + 4⁹ + 5⁹ + 6⁹ + 7⁹ + 8⁹ + 9⁹ ^[23]
575,023,344 = x^x 在 x=1 处的 14 阶导数^[24]
594,823,321 = 24389² = 841³ = 29⁶
596,572,387 = 韦德本-埃瑟林顿素数^[2]

600,000,000 至 699,999,999

601,692,057 = 57⁵
612,220,032 = 18⁷
617,323,716 = 24846², 回文平方
635,318,657 = 欧拉知道的两个四次方以两种不同方式相加的最小数 ( 59⁴ + 158⁴ = 133⁴ + 134⁴ )。
644,972,544 = 864³, 3-平滑数
656,356,768 = 58⁵
666,666,666 = 純位數
670,617,279 = Collatz 猜想的 10⁹以下的最高停止时间整数

700,000,000 至 799,999,999

701,408,733 = 斐波那契数
714,924,299 = 59⁵
715,497,037 = 具有 38 个节点的缩减树的数量^[9]
715,827,883 =瓦格斯塔夫素数， ^[25]雅各布斯塔尔素数
725,594,112 = GF(2) 上的 36 次本原多项式的数量^[13]
729,000,000 = 27000² = 900³ = 30⁶
742,624,232 = 免费 19 联骨牌数量
774,840,978 = 利兰数
777,600,000 = 60⁵
777,777,777 = 純位數
778,483,932 = Fine Number
780,291,637 = 马尔可夫素数
787,109,376 = 1-自守数^[14]

800,000,000 至 899,999,999

815,730,721 = 13⁸
815,730,721 = 169⁴
835,210,000 = 170⁴
837,759,792 = 26 个单元的平行四边形多骨牌数量。 ^[8]
844,596,301 = 61⁵
855,036,081 = 171⁴
875,213,056 = 172⁴
887,503,681 = 31⁶
888,888,888 = 纯位数
893,554,688 = 2-自守数^[26]
893,871,739 = 19⁷
895,745,041 = 173⁴

900,000,000 至 999,999,999

906,150,257 = 波利亚猜想的最小反例
916,132,832 = 62⁵
923,187,456 = 30384² ，最大的无零泛数字平方
928,772,650 = 补数相等的 37 珠项链数量（允许翻转） ^[4]
929,275,200 = GF(2) 上的 35 次本原多项式的数量^[13]
942,060,249 = 30693²，回文平方
987,654,321 = 最大的无零泛数字
992,436,543 = 63⁵
997,002,999 = 999³ ，最大的9位立方
999,950,884 = 31622² ，最大的九位数平方
999,961,560 = 最大的 9 位数三角数和第 44,720 个三角数
999,999,937 = 最大的 9 位质数
999,999,999 = 純位數

参考

^ Sloane, N.J.A. (编). Sequence A003617 (Smallest n-digit prime). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. [7 September 2017].
^ ^2.0 ^2.1 ^2.2 Sloane, N.J.A. (编). Sequence A001190 (Wedderburn-Etherington numbers). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. [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. (编). Sequence A002104 (Logarithmic numbers). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^4.0 ^4.1 ^4.2 ^4.3 Sloane, N.J.A. (编). Sequence A000011 (Number of n-bead necklaces (turning over is allowed) where complements are equivalent). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^5.0 ^5.1 Sloane, N.J.A. (编). Sequence A000108 (Catalan numbers). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. [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.
^ ^6.0 ^6.1 ^6.2 Sloane, N.J.A. (编). 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.
^ ^7.0 ^7.1 Sloane, N.J.A. (编). Sequence A001006 (Motzkin numbers). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. [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.
^ ^8.0 ^8.1 ^8.2 Sloane, N.J.A. (编). 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.
^ ^9.0 ^9.1 ^9.2 Sloane, N.J.A. (编). Sequence A000014 (Number of series-reduced trees with n nodes). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N.J.A. (编). Sequence A000258 (Expansion of e.g.f. exp(exp(exp(x)-1)-1)). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane's A000110 : Bell or exponential numbers. The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. [2016-06-17]. （原始内容存档于2019-08-30）.
^ ^12.0 ^12.1 Sloane, N.J.A. (编). Sequence A005893 (Number of points on surface of tetrahedron). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^13.0 ^13.1 ^13.2 ^13.3 Sloane, N.J.A. (编). Sequence A011260 (Number of primitive polynomials of degree n over GF(2)). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ ^14.0 ^14.1 Sloane, N.J.A. (编). Sequence A003226 (Automorphic numbers). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-04-06.
^ ^15.0 ^15.1 Sloane, N.J.A. (编). Sequence A000129 (Pell numbers). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. [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's A002201 : Superior highly composite numbers. The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. [2016-06-17]. （原始内容存档于2010-12-29）.
^ Sloane's A004490 : Colossally abundant numbers. The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. [2016-06-17]. （原始内容存档于2012-05-25）.
^ Sloane's A005165 : Alternating factorials. The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. [2016-06-17]. （原始内容存档于2012-10-09）.
^ Sloane, N.J.A. (编). 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. (编). Sequence A006785 (Number of triangle-free graphs on n vertices). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane's A088054 : Factorial primes. The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. [2016-06-17]. （原始内容存档于2020-10-03）.
^ Sloane, N.J.A. (编). 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. [2022-06-02].
^ Sloane, N.J.A. (编). Sequence A031971. The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane, N.J.A. (编). Sequence A005727. The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
^ Sloane's A000979 : Wagstaff primes. The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. [2016-06-17]. （原始内容存档于2010-11-25）.
^ Sloane, N.J.A. (编). Sequence A030984 (2-automorphic numbers). The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. [2021-09-01].

大数

范例（按数字大小排列）

古戈爾 · 古戈尔普勒克斯 · 斯奎斯数 · 古戈爾普勒克斯普勒克斯（英语：Googolplexplex） · 莫澤數 · 葛立恆數 · TREE(3)（英语：TREE(3)） · SSCG(3)（英语：Friedman’s SSCG function） · 拉約數 · 超限数 · ∞

表达方法

记号	高德納箭號表示法 · 康威鏈式箭號表示法 · 斯坦豪斯-莫澤表示法 · 急成长阶层 · 缓成长阶层

运算	超运算（迭代冪次 · 五級運算） · 阿克曼函數