10,000,000

Last updated
10000000
Cardinal Ten million
Ordinal 10000000th
(ten millionth)
Factorization 27 · 57
Greek numeral
Roman numeral X
Greek prefix hebdo-
Binary 1001100010010110100000002
Ternary 2002110011021013
Senary 5542001446
Octal 461132008
Duodecimal 342305412
Hexadecimal 98968016

10,000,000 (ten million) is the natural number following 9,999,999 and preceding 10,000,001.

Contents

In scientific notation, it is written as 107.

In South Asia except for Sri Lanka, 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

20,000,000 to 29,999,999

30,000,000 to 39,999,999

40,000,000 to 49,999,999

50,000,000 to 59,999,999

60,000,000 to 69,999,999

70,000,000 to 79,999,999

80,000,000 to 89,999,999

90,000,000 to 99,999,999

See also

References

  1. 1 2 3 4 Sloane, N. J. A. (ed.). "SequenceA000014(Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  2. 1 2 Sloane, N. J. A. (ed.). "SequenceA000060(Number of signed trees with n nodes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  3. Sloane, N. J. A. (ed.). "SequenceA002104(Logarithmic numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  4. Sloane, N. J. A. (ed.). "SequenceA002275(Repunits: (10^n - 1)/9. Often denoted by R_n)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  5. 1 2 3 Sloane, N. J. A. (ed.). "SequenceA007629(Repfigit (REPetitive FIbonacci-like diGIT) numbers (or Keith numbers))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  6. 1 2 Sloane, N. J. A. (ed.). "SequenceA003226(Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  7. 1 2 Sloane, N. J. A. (ed.). "SequenceA000055(Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  8. 1 2 3 Sloane, N. J. A. (ed.). "SequenceA000045(Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  9. 1 2 Sloane, N. J. A. (ed.). "SequenceA000957(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)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  10. 1 2 3 Sloane, N. J. A. (ed.). "SequenceA000129(Pell numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  11. Sloane, N. J. A. (ed.). "SequenceA000258(Expansion of e.g.f. exp(exp(exp(x)-1)-1))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  12. 1 2 3 Sloane, N. J. A. (ed.). "SequenceA000011(Number of n-bead necklaces (turning over is allowed) where complements are equivalent)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  13. Sloane, N. J. A. (ed.). "SequenceA001923(a(n) = Sum_{k=1..n} k^k.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  14. 1 2 3 4 Sloane, N. J. A. (ed.). "SequenceA011260(Number of primitive polynomials of degree n over GF(2))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  15. 1 2 3 Sloane, N. J. A. (ed.). "SequenceA000013(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.
  16. 1 2 Sloane, N. J. A. (ed.). "SequenceA001006(Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  17. 1 2 Sloane, N. J. A. (ed.). "SequenceA001190(Wedderburn-Etherington numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  18. Sloane, N. J. A. (ed.). "SequenceA006785(Number of triangle-free graphs on n vertices)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  19. Sloane, N. J. A. (ed.). "SequenceA004490(Colossally abundant numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  20. Sloane, N. J. A. (ed.). "SequenceA002201(Superior highly composite numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  21. 1 2 Sloane, N. J. A. (ed.). "SequenceA048102(Numbers k such that if k equals Product p_i^e_i then p_i equals e_i for all i)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  22. Sloane, N. J. A. (ed.). "SequenceA031971(Sum_{1..n} k^n)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  23. Sloane, N. J. A. (ed.). "SequenceA000110(Bell numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  24. Sloane, N. J. A. (ed.). "SequenceA000396(Perfect numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  25. Sloane, N. J. A. (ed.). "SequenceA002416(2^(n^2))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  26. Sloane, N. J. A. (ed.). "SequenceA000108(Catalan numbers: (2n)!/(n!(n+1)!))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  27. Sloane, N. J. A. (ed.). "SequenceA005165(Alternating factorials)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  28. Sloane, N. J. A. (ed.). "SequenceA122400(Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  29. Sloane, N. J. A. (ed.). "SequenceA088054(Factorial primes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  30. Sloane, N. J. A. (ed.). "SequenceA049363(a(1) = 1; for n > 1, smallest digitally balanced number in base n.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  31. Sloane, N. J. A. (ed.). "SequenceA006879(Number of primes with n digits.)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  32. Sloane, N. J. A. (ed.). "SequenceA000112(Number of partially ordered sets (posets) with n unlabeled elements)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  33. Sloane, N. J. A. (ed.). "SequenceA060843(Maximum number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  34. Sloane, N. J. A. (ed.). "SequenceA181098(Primefree centuries (i.e., no prime exists between 100*n and 100*n+99))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  35. Sloane, N. J. A. (ed.). "SequenceA219996(Centuries whose prime pattern is the same as prime pattern in the previous century)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  36. Sloane, N. J. A. (ed.). "SequenceA006958(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.
  37. Sloane, N. J. A. (ed.). "SequenceA023188(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.
  38. Sloane, N. J. A. (ed.). "SequenceA138058(Prime numbers, isolated from neighboring primes by ± 100 (or more))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  39. Sloane, N. J. A. (ed.). "SequenceA011541(Taxicab, taxi-cab or Hardy-Ramanujan numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  40. Sloane, N. J. A. (ed.). "SequenceA349264(Generalized Euler numbers, a(n) = n!*[x^n](sec(4*x)*(sin(4*x) + 1)))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  41. Sloane, N. J. A. (ed.). "SequenceA030984(2-automorphic numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  42. Sloane, N. J. A. (ed.). "SequenceA040017(Unique period primes (no other prime has same period as 1/p) in order (periods are given in A051627))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
  43. "greatest prime number with 8 digits". Wolfram Alpha . Retrieved June 4, 2014.