10,000,000
10,000,000 (ten million) is the natural number following 9,999,999 and preceding 10,000,001.
10000000 | |
---|---|
Cardinal | Ten million |
Ordinal | 10000000th (ten millionth) |
Factorization | 27 · 57 |
Greek numeral | |
Roman numeral | X |
Greek prefix | hebdo- |
Binary | 1001100010010110100000002 |
Ternary | 2002110011021013 |
Octal | 461132008 |
Duodecimal | 342305412 |
Hexadecimal | 98968016 |
In scientific notation, it is written as 107.
In South Asia, it is known as the crore.
In Cyrillic numerals, it is known as the vran (вран - raven).
Selected 8-digit numbers (10,000,001–99,999,999)
10,000,001 to 19,999,999
- 10,000,019 – smallest 8-digit prime number
- 10,001,628 – smallest triangular number with 8 digits and the 4,472nd triangular number
- 10,077,696 = 69
- 10,609,137 – Leyland number
- 11,111,111 – repunit
- 11,390,625 = 156
- 11,436,171 – Keith number[1]
- 11,485,154 – Markov number
- 11,881,376 = 265
- 12,252,240 – highly composite number, smallest number divisible by all the numbers 1 through 18
- 12,890,625 – 1-automorphic number[2]
- 12,960,000 = 604, (3·4·5)4, Plato's "nuptial number" (Republic VIII; see regular number)
- 12,648,430 – hexadecimal C0FFEE, resembling the word "coffee"; used as a placeholder in computer programming, see hexspeak.
- 12,988,816 – number of different ways of covering an 8-by-8 square with 32 1-by-2 dominoes
- 13,782,649 – Markov number
- 14,348,907 = 315
- 14,352,282 – Leyland number
- 14,930,352 – Fibonacci number[3]
- 15,485,863 – 1,000,000th prime number
- 15,994,428 – Pell number[4]
- 16,609,837 – Markov number
- 16,769,023 – Carol prime[5] and an emirp
- 16,777,216 = 224 – hexadecimal "million" (0x1000000), number of possible colors in 24/32-bit Truecolor computer graphics
- 16,777,792 – Leyland number
- 16,785,407 – Kynea number[6]
- 16,797,952 – Leyland number
- 16,964,653 – Markov number
- 17,016,602 – index of a prime Woodall number
- 17,210,368 = 285
- 17,650,828 = 11 + 22 + 33 + 44 + 55 + 66 + 77 + 88
- 18,199,284 – Motzkin number[7]
- 19,487,171 = 117
- 19,680,277 – Wedderburn-Etherington number[8]
- 19,987,816 – palindromic in 3 consecutive bases: 41AAA1413, 292429214, 1B4C4B115
20,000,000 to 29,999,999
- 20,031,170 – Markov number
- 20,511,149 = 295
- 21,531,778 – Markov number
- 21,621,600 – colossally abundant number,[9] superior highly composite number[10]
- 22,222,222 – repdigit
- 24,137,569 = 176
- 24,157,817 – Fibonacci number,[3] Markov number
- 24,300,000 = 305
- 24,678,050 – equal to the sum of the eighth powers of its digits
- 27,644,437 – Bell number[11]
- 28,629,151 = 315
30,000,000 to 39,999,999
- 31,536,000 – standard number of seconds in a non-leap year (omitting leap seconds)
- 31,622,400 – standard number of seconds in a leap year (omitting leap seconds)
- 33,333,333 – repdigit
- 33,445,755 – Keith number[1]
- 33,550,336 – fifth perfect number[12]
- 33,554,432 = 225 – Leyland number
- 33,555,057 – Leyland number
- 34,012,224 = 186
- 35,831,808 = 127
- 36,614,981 – alternating factorial[13]
- 38,613,965 – Pell number,[4] Markov number
- 39,088,169 – Fibonacci number[3]
- 39,135,393 = 335
- 39,916,800 = 11!
- 39,916,801 – factorial prime[14]
40,000,000 to 49,999,999
- 40,353,607 = 79
- 43,046,721 = 316
- 43,050,817 – Leyland number
- 43,112,609 – Mersenne prime exponent
- 43,443,858 – palindromic in 3 consecutive bases: 3C323C315, 296E69216, 1DA2AD117
- 43,484,701 – Markov number
- 44,121,607 – Keith number[1]
- 44,444,444 – repdigit
- 45,136,576 – Leyland number
- 45,435,424 = 345
- 46,026,618 – Wedderburn-Etherington number[8]
- 46,656,000 = 3603
- 47,045,881 = 196
- 48,828,125 = 511
- 48,928,105 – Markov number
- 48,989,176 – Leyland number
50,000,000 to 59,999,999
- 50,852,019 – Motzkin number[7]
- 52,521,875 = 355
- 55,555,555 – repdigit
60,000,000 to 69,999,999
- 60,466,176 – 610
- 61,466,176 – Leyland number
- 62,748,517 = 137
- 63,245,986 – Fibonacci number, Markov number
- 64,000,000 = 206 – vigesimal "million" (1 alau in Mayan, 1 poaltzonxiquipilli in Nahuatl)
- 66,600,049 - Largest minimal prime in base 10
- 66,666,666 – repdigit
- 67,092,479 – Carol number[15]
- 67,108,864 = 226
- 67,109,540 – Leyland number
- 67,125,247 – Kynea number[6]
- 67,137,425 – Leyland number
- 69,343,957 = 375
70,000,000 to 79,999,999
- 72,546,283 – the smallest prime number preceded and followed by prime gaps of over 100[16]
- 73,939,133 – the largest prime number that can be 'tailed' again and again by removing its last digit to produce only primes
- 74,207,281 – Mersenne prime exponent
- 77,777,777 – repdigit
- 78,442,645 – Markov number
- 79,235,168 = 385
80,000,000 to 89,999,999
- 85,766,121 – 216
- 86,400,000 – hyperfactorial of 5; 11 × 22 × 33 × 44 × 55
- 87,109,375 – 1-automorphic number[2]
- 87,539,319 – taxicab number[17]
- 88,888,888 – repdigit
90,000,000 to 99,999,999
- 90,224,199 = 395
- 93,222,358 – Pell number[4]
- 94,418,953 – Markov number
- 99,991,011 – largest triangular number with 8 digits and the 14,141st triangular number
- 99,999,989 – greatest prime number with 8 digits[18]
- 99,999,999 – repdigit, Friedman number, believed to be smallest number to be both repdigit and Friedman
gollark: Randomized controlled trials.
gollark: This is true and not false.
gollark: Well, correlation is correlated with causation, r = 0.8.
gollark: I don't really have much to base such an assumption on, so I don't assume that.
gollark: ☭ you at a degree of π³.
See also
References
- "Sloane's A007629 : Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
- Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-04-06.
- "Sloane's A000045 : Fibonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
- "Sloane's A000129 : Pell numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
- "Sloane's A091516 : Primes of the form 4^n - 2^(n+1) - 1". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
- "Sloane's A093069 : a(n) = (2^n + 1)^2 - 2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
- "Sloane's A001006 : Motzkin numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
- "Sloane's A001190 : Wedderburn-Etherington numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
- "Sloane's A004490 : Colossally abundant 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. Retrieved 2016-06-17.
- "Sloane's A000110 : Bell numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
- "Sloane's A000396 : Perfect numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
- "Sloane's A005165 : Alternating factorials". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
- "Sloane's A088054 : Factorial primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
- "Sloane's A093112 : a(n) = (2^n-1)^2 - 2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
- Sloane, N. J. A. (ed.). "Sequence A023188 (Lonely (or isolated) primes: least prime of distance n from nearest prime (n = 1 or even).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-01-27.
- "Sloane's A011541 : Taxicab, taxi-cab or Hardy-Ramanujan numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-17.
- "greatest prime number with 8 digits". Wolfram Alpha. Retrieved June 4, 2014.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.