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.
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
232,792,560 =
superior highly composite number;[22]colossally abundant number;[23] smallest number divisible by the numbers from 1 to 22 (there is no smaller number divisible by the numbers from 1 to 20 since any number divisible by 3 and 7 must be divisible by 21 and any number divisible by 2 and 11 must be divisible by 22)
240,882,152 = number of signed trees with 16 nodes[24]
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]
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]
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
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.
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
232,792,560 =
superior highly composite number;[22]colossally abundant number;[23] smallest number divisible by the numbers from 1 to 22 (there is no smaller number divisible by the numbers from 1 to 20 since any number divisible by 3 and 7 must be divisible by 21 and any number divisible by 2 and 11 must be divisible by 22)
240,882,152 = number of signed trees with 16 nodes[24]
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]
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]
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