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.
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
134,217,728 = 5123 = 89 = 227
134,218,457 = Leyland number using 2 & 27 (227 + 272)
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
136,279,841 = The largest known Mersenne prime exponent, as of October 2024
139,854,276 = 118262, the smallest zeroless base 10 pandigital square
232,792,560 = superior highly composite number; colossally abundant number; 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
245,492,244 = number of 35-bead necklaces (turning over is allowed) where complements are equivalent
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
253,450,711 = Wedderburn-Etherington prime
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
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
535,828,591 = Leonardo prime
536,870,911 = third composite Mersenne number with a prime exponent
797,790,928 = number of centered hydrocarbons with 29 carbon atoms
800,000,000 to 899,999,999
810,810,000 = smallest number with exactly 1000 factors
837,759,792 – number of parallelogram polyominoes with 26 cells.
839,296,300 – initial number of first century xx00 to xx99 containing at least sixteen prime numbers {839,296,301, 839,296,303, 839,296,309, 839,296,319, 839,296,321, 839,296,327, 839,296,331, 839,296,333, 839,296,349, 839,296,351, 839,296,357, 839,296,361, 839,296,373, 839,296,379, 839,296,397, 839,296,399} since 2,705,000
928,772,650 = number of 37-bead necklaces (turning over is allowed) where complements are equivalent
929,275,200 = number of primitive polynomials of degree 35 over GF(2)
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
987,654,321 = largest zeroless base-10 pandigital number
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