Knowledge (XXG)

10,000

Source 📝

(Redirected from 10000 (number))
This article is about the natural number (and other integers between 10,000 and 19,999). For other uses, see 10,000 (disambiguation).
Natural number
← 9999 10000 10001 →
Cardinalten thousand
Ordinal10000th
(ten thousandth)
Numeral systemdecamillesimal
Factorization2 × 5
Divisors25 total
Greek numeral M α {\displaystyle {\stackrel {\alpha }{\mathrm {M} }}}
Roman numeralX
Unicode symbol(s)X, ↂ
Greek prefixmyria-
Latin prefixdecamilli-
Binary100111000100002
Ternary1112011013
Senary1141446
Octal234208
Duodecimal595412
Hexadecimal271016
Chinese numeral万, 萬
ArmenianՕ
Egyptian hieroglyph𓂭

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

Name

Many languages have a specific word for this number: in Ancient Greek it is μύριοι (the etymological root of the word myriad in English), in Aramaic ܪܒܘܬܐ, in Hebrew רבבה , in Chinese 萬/万 (Mandarin wàn, Cantonese maan6, Hokkien bān), in Japanese 万/萬 , in Khmer ម៉ឺន , in Korean 만/萬 , in Russian тьма , in Vietnamese vạn, in Sanskrit अयुत , in Thai หมื่น , in Malayalam പതിനായിരം , and in Malagasy alina. In many of these languages, it often denotes a very large but indefinite number.

The classical Greeks used letters of the Greek alphabet to represent Greek numerals: they used a capital letter mu (Μ) to represent ten thousand. This Greek root was used in early versions of the metric system in the form of the decimal prefix myria-.

Depending on the country, the number ten thousand is usually written as 10,000 (including in the UK and US), 10.000, or 10 000.

In mathematics

In scientific notation it is written as 10 or 1 E+4 (equivalently 1 E4) in E notation.

It is the square of 100 and the square root of 100,000,000.

The value of a myriad to the power of itself, 10000 = 10.

It has a total of 25 divisors, whose geometric mean is a whole number, 100 (the number of primes below this value is 25).

It has a reduced totient of 500, and a totient of 4,000, with a total of 16 integers having a totient value of 10,000.

There are a total of 1,229 prime numbers less than ten thousand, a count that is itself prime.

A myriagon is a polygon with ten thousand edges and a total of 25 dihedral symmetry groups when including the myriagon itself, alongside 25 cyclic groups as subgroups.

In science

In time

In the arts

In other fields

Selected numbers in the range 10001-19999

10001 to 10999

11000 to 11999

  • 11025 = 105, the sum of the first 14 positive integers cubes.
  • 11083 = palindromic prime in 2 consecutive bases: 23 (KLK23) and 24 (J5J24).
  • 11111 = Repunit
  • 11297 = Number of planar partitions of 16
  • 11298 = Riordan number
  • 11311 = palindromic prime in decimal.
  • 11340 = Harshad number in bases 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15 and 16.
  • 11353 = star prime.
  • 11368 = pentagonal pyramidal number
  • 11410 = weird number.
  • 11411 = palindromic prime in decimal.
  • 11424 = Harshad number in bases 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15 and 16.
  • 11440 = square pyramidal number.
  • 11480 = tetrahedral number.
  • 11574 = approximate number of days in a billion seconds
  • 11593 = smallest prime to start a run of nine consecutive primes of the form 4k + 1.
  • 11605 = smallest integer to start a run of five consecutive integers with the same number of divisors.
  • 11690 = weird number.
  • 11717 = twin prime with 11719.
  • 11719 = cuban prime, twin prime with 11717.
  • 11726 = octahedral number.
  • 11781 = Triangular number, Hexagonal number, Octagonal number, and also 58-gonal, 216-gonal, 329-gonal, 787-gonal and 3928-gonal number.
  • 11826 = smallest number whose square is pandigital without zeros.
  • 11953 = palindromic prime in bases 7 (465647) and 30 (D8D30).

12000 to 12999

  • 12000 = 12,000 of each of the twelve tribes of Israel made up the 144,000 servants of God who were 'sealed' according to the Book of Revelation in the New Testament.
  • 12048 = number of non-isomorphic set-systems of weight 12.
  • 12097 = cuban prime.
  • 12101 = Friedman prime.
  • 12107 = Friedman prime.
  • 12109 = Friedman prime.
  • 12110 = weird number.
  • 12167 = 23
  • 12172 = number of triangle-free graphs on 10 vertices
  • 12198 = semi-meandric number
  • 12251 = number of primes 2 17 {\displaystyle \leq 2^{17}} .
  • 12285 = amicable number with 14595.
  • 12287 = Thabit number.
  • 12289 = Proth prime, Pierpont prime.
  • 12310 = number of partitions of 34
  • 12321 = 111, Demlo number, palindromic square.
  • 12341 = tetrahedral number.
  • 12345 = smallest whole number containing all numbers from 1 to 5
  • 12407 = cited on Q.I. as the smallest uninteresting positive integer regarding arithmetical mathematics.
  • 12421 = palindromic prime.
  • 12496 = smallest sociable number.
  • 12500 = 2×5
  • 12529 = square pyramidal number.
  • 12530 = weird number.
  • 12542 = there is a match puzzle called MOST + MOST = TOKYO, where each letter represents a digit. When one solves the puzzle, TOKYO = 12542, as 6271 + 6271 = 12542
  • 12670 = weird number.
  • 12721 = palindromic prime.
  • 12726 = Ruth–Aaron pair.
  • 12758 = most significant Number that cannot be expressed as the sum of distinct cubes.
  • 12765 = Finnish internet meme; the code accompanying no-prize caps in a Coca-Cola bottle top prize contest. Often spelled out yksikaksiseitsemänkuusiviisi, ei voittoa, "one – two – seven – six – five, no prize".
  • 12769 = 113, palindromic in base 3.
  • 12821 = palindromic prime.

13000 to 13999

  • 13131 = octahedral number.
  • 13244 = tetrahedral number.
  • 13267 = cuban prime.
  • 13331 = palindromic prime.
  • 13370 = weird number.
  • 13510 = weird number.
  • 13581 = Padovan number.
  • 13648 = number of 20-bead necklaces (turning over is allowed) where complements are equivalent
  • 13669 = cuban prime.
  • 13685 = square pyramidal number.
  • 13790 = weird number.
  • 13792 = largest number that is not a sum of 16 fourth powers.
  • 13798 = number of 19-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed
  • 13820 = meandric number, open meandric number.
  • 13824 = 24
  • 13831 = palindromic prime.
  • 13860 = Pell number.
  • 13930 = weird number.
  • 13931 = palindromic prime.
  • 13950 = pentagonal pyramidal number.

14000 to 14999

  • 14190 = tetrahedral number.
  • 14200 = number of n-Queens Problem solutions for n – 12.
  • 14341 = palindromic prime.
  • 14400 = 120, the sum of the first 15 positive integers cubes.
  • 14595 = amicable number with 12285.
  • 14641 = 121 = 11, palindromic square (base 10).
  • 14644 = octahedral number.
  • 14701 = Markov number.
  • 14741 = palindromic prime.
  • 14770 = weird number.
  • 14883 = number of partitions of 35
  • 14884 = 122, palindromic square in base 11.
  • 14910 = square pyramidal number.

15000 to 15999

  • 15015 = smallest odd and square-free abundant number.
  • 15120 = highly composite number; smallest number with exactly 80 factors.
  • 15180 = tetrahedral number.
  • 15376 = 124, pentagonal pyramidal number.
  • 15387 = Zeisel number.
  • 15451 = palindromic prime.
  • 15511 = Motzkin prime.
  • 15551 = palindromic prime.
  • 15610 = weird number.
  • 15625 = 125 = 25 = 5
  • 15629 = Friedman prime.
  • 15640 = initial number of only four-, five-, or six-digit century to contain two prime quadruples (in between which lies a record prime gap of 43).
  • 15661 = Friedman prime.
  • 15667 = second nice Friedman prime.
  • 15679 = Friedman prime.
  • 15793 – Number of parallelogram polyominoes with 13 cells.
  • 15841 = Carmichael number.
  • 15876 = 126, palindromic square in base 5.
  • 15890 = weird number.

16000 to 16999

  • 16030 = weird number.
  • 16057 = the following prime sextuplet after 97, 16061, 16063, 16067, 16069, and 16073.
  • 16061 = palindromic prime.
  • 16072 = logarithmic number.
  • 16091 = strobogrammatic prime.
  • 16206 = square pyramidal number.
  • 16269 = octahedral number.
  • 16310 = weird number.
  • 16361 = palindromic prime.
  • 16381 = Friedman prime.
  • 16384 = 128 = 2, palindromic in base 15.
  • 16447 = third nice Friedman prime.
  • 16561 = palindromic prime.
  • 16580 = Leyland number.
  • 16651 = cuban prime.
  • 16661 = palindromic prime.
  • 16730 = weird number.
  • 16759 = Friedman prime.
  • 16796 = Catalan number.
  • 16807 = 7
  • 16843 = smallest Wolstenholme prime.
  • 16870 = weird number.
  • 16879 = Friedman prime.
  • 16896 = pentagonal pyramidal number.
  • 16999 = number of partially ordered set with 8 unlabeled elements.

17000 to 17999

  • 17073 = number of free 11-ominoes.
  • 17163 = the most significant number that is not the sum of the squares of distinct primes.
  • 17272 = weird number.
  • 17296 = amicable number with 18416.
  • 17344 = Kaprekar number.
  • 17389 = 2000th prime number.
  • 17471 = palindromic prime.
  • 17496 = 3-smooth number (2×3)
  • 17570 = weird number.
  • 17575 = square pyramidal number.
  • 17576 = 26, palindromic in base 5.
  • 17689 = 133, palindromic in base 11.
  • 17711 = Fibonacci number.
  • 17971 = palindromic prime.
  • 17977 = number of partitions of 36
  • 17990 = weird number.
  • 17991 = Padovan number.

18000 to 18999

  • 18010 = octahedral number.
  • 18181 = palindromic prime, strobogrammatic prime.
  • 18334 = number of planar partitions of 17
  • 18410 = weird number.
  • 18416 = amicable number with 17296.
  • 18481 = palindromic prime.
  • 18496 = 136, the sum of the first 16 positive integers cubes.
  • 18600 = harmonic divisor number.
  • 18620 = harmonic divisor number.
  • 18785 = Leyland number.
  • 18830 = weird number.
  • 18970 = weird number.

19000 to 19999

  • 19019 = square pyramidal number.
  • 19141 = unique prime in base 12.
  • 19302 = Number of ways to partition {1,2,3,4,5,6,7} and then partition each cell (block) into subcells.
  • 19320 = number of trees with 16 unlabeled nodes
  • 19390 = weird number.
  • 19391 = palindromic prime.
  • 19417 = prime sextuplet, along with 19421, 19423, 19427, 19429, and 19433.
  • 19441 = cuban prime.
  • 19455 = smallest integer that cannot be expressed as a sum of fewer than 548 ninth powers.
  • 19513 = tribonacci number.
  • 19531 = repunit prime in base 5.
  • 19600 = 140, tetrahedral number.
  • 19601/13860 ≈ √2
  • 19609 = first prime followed by a prime gap of over fifty.
  • 19670 = weird number.
  • 19683 = 27, 3. Furthermore, there is a math puzzle regarding the word logic, such that LOGIC = (L+O+G+I+C). The solution to this is (1+9+6+8+3) (1+9+6+8+3) (1+9+6+8+3), which is (27)(27)(27), which equals to 19683. This is one of two digits for which this works, although the other solution has O and I are the same digit: 17576, as (1+7+5+7+6) (1+7+5+7+6) (1+7+5+7+6) = (26)(26)(26) = 17576.
  • 19729 is the number of digits in 2 ↑ ↑ 5 {\displaystyle 2\uparrow \uparrow 5} (Tetration)
  • 19739 = fourth nice Friedman prime.
  • 19871 = octahedral number.
  • 19891 = palindromic prime.
  • 19927 = cuban prime.
  • 19991 = palindromic prime.

Primes

There are 1033 prime numbers between 10000 and 20000, a count that is itself prime. It is 196 prime numbers less than the number of primes between 0 and 10000 (1229, also prime).

See also

Notes

  1. On the basis that it did not then (November 2011) appear in Sloane's On-Line Encyclopedia of Integer Sequences.

References

  1. "Malagasy Dictionary and Madagascar Encyclopedia : Alina".
  2. "Myriad Definition & Meaning - Merriam-Webster". Merriam-Webster's Online Dictionary. 13 March 2024.
  3. Baldwin, James (1885). "Notes on Teaching History". Educational Weekly. 5 (2): 4–5. ISSN 2475-3262. JSTOR 44009109.
  4. "Decimal and Thousands Separators (International Language Environments Guide)". oracle.com.
  5. ^ Sloane, N. J. A. (ed.). "Sequence A006880 (Number of primes less than 10^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  6. Sloane, N. J. A. (ed.). "Sequence A002322 (Reduced totient function)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  7. Sloane, N. J. A. (ed.). "Sequence A000010 (Euler totient function)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  8. Sloane, N. J. A. (ed.). "Sequence A000040 (The prime numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. See "Table of n, prime(n) for n = 1..10000" under "Links".
  9. John Horton Conway; Heidi Burgiel; Chaim Goodman-Strauss (2008). The Symmetries of Things. A K Peters/CRC Press. ISBN 978-1-56881-220-5. Chapter 20.
  10. Climate Timeline Information Tool
  11. news
  12. "NASA Project: Columbia". Archived from the original on 2005-04-08. Retrieved 2005-02-15.
  13. 10000 trails web site
  14. "Ten Thousand Islands NWR". U.S. Fish & Wildlife Service. Archived from the original on 2005-03-01. Retrieved 2005-02-14.
  15. Brewster, David (1830). The Edinburgh Encyclopædia. Vol. 12. Edinburgh, UK: William Blackwood, John Waugh, John Murray, Baldwin & Cradock, J. M. Richardson. p. 494. Retrieved 2015-10-09.
  16. Brewster, David (1832). The Edinburgh Encyclopaedia. Vol. 12 (1st American ed.). Joseph and Edward Parker. Retrieved 2015-10-09.
  17. Dingler, Johann Gottfried (1823). Polytechnisches Journal (in German). Vol. 11. Stuttgart, Germany: J.W. Gotta'schen Buchhandlung. Retrieved 2015-10-09.
  18. "Iraq Dinar Currency Photos| Banknote Series | 25000, 10000, 5000, 1000, 250, 50 Dinars". iraqi-dinar.com. Archived from the original on 2005-02-07. Retrieved 2022-08-04.
  19. http://www.iraqsales.com/10%2C000.htm Archived 2005-02-06 at the Wayback Machine
  20. Brand, Stewart. "The 10,000-Year Library". kurzweilai.net. Archived from the original on 2005-02-05. Retrieved 2022-08-04.
  21. "Army of 10,000". mississippiscv.org. Archived from the original on 2002-04-01. Retrieved 2022-08-04.
  22. "University of Michigan Digital Library - Login Options".
  23. "Tao Te Ching, Verse 34". thebigview.com. Archived from the original on 2007-08-17. Retrieved 2022-08-04.
  24. https://www.gutenberg.org/ebooks/926 : Ten Thousand Dreams Interpreted
  25. http://bible.gospelcom.net/keyword/?search=ten%20thousand&version1=9&searchtype=phrase&wholewordsonly=yes ,
  26. (KJV) The Apocalypse of John
  27. The Catholic Encyclopedia
  28. Ulmer, Jeanne. "Minnesota Cycling Team –Tour of 10,000 Lakes". tourof10000lakes.net. Archived from the original on 2005-02-21. Retrieved 2022-08-04.
  29. ^ Sloane, N. J. A. (ed.). "Sequence A002182 (Highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  30. ^ Sloane, N. J. A. (ed.). "Sequence A000041 (a(n) is the number of partitions of n (the partition numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  31. Sloane, N. J. A. (ed.). "Sequence A273987 (Smallest Riesel number to base n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  32. ^ Sloane, N. J. A. (ed.). "Sequence A002411 (Pentagonal pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  33. Sloane, N. J. A. (ed.). "Sequence A003261 (Woodall (or Riesel) numbers: n*2^n - 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  34. ^ Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  35. ^ Sloane, N. J. A. (ed.). "Sequence A002407 (Cuban primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  36. ^ Sloane, N. J. A. (ed.). "Sequence A083577 (Prime star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  37. ^ Sloane, N. J. A. (ed.). "Sequence A000330 (Square pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  38. ^ Sloane, N. J. A. (ed.). "Sequence A005900 (Octahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  39. ^ Sloane, N. J. A. (ed.). "Sequence A006037 (Weird numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  40. ^ Sloane, N. J. A. (ed.). "Sequence A002385 (Palindromic primes: prime numbers whose decimal expansion is a palindrome)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  41. ^ Sloane, N. J. A. (ed.). "Sequence A002997 (Carmichael numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  42. ^ Sloane, N. J. A. (ed.). "Sequence A000073 (Tribonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  43. ^ Sloane, N. J. A. (ed.). "Sequence A000292 (Tetrahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  44. Sloane, N. J. A. (ed.). "Sequence A000078 (Tetranacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  45. Sloane, N. J. A. (ed.). "Sequence A001190 (Wedderburn-Etherington numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  46. ^ Sloane, N. J. A. (ed.). "Sequence A000045 (Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  47. ^ Sloane, N. J. A. (ed.). "Sequence A002559 (Markoff (or Markov) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  48. Taneja, Inder (2013). "Crazy Sequential Representation: Numbers from 0 to 11111 in terms of Increasing and Decreasing Orders of 1 to 9". arXiv:1302.1479 .
  49. Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  50. Sloane, N. J. A. (ed.). "Sequence A002275 (Repunits: (10^n - 1)/9. Often denoted by R_n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  51. ^ Sloane, N. J. A. (ed.). "Sequence A000219 (Number of planar partitions (or plane partitions) of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  52. Sloane, N. J. A. (ed.). "Sequence A000217 (Triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  53. Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  54. Sloane, N. J. A. (ed.). "Sequence A000567 (Octagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  55. Revelation 7:4–8
  56. Sloane, N. J. A. (ed.). "Sequence A006785 (Number of triangle-free graphs on n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  57. Sloane, N. J. A. (ed.). "Sequence A000682 (Semimeanders)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  58. Sloane, N. J. A. (ed.). "Sequence A007053 (Number of primes <= 2^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  59. Host: Stephen Fry; Panellists: Alan Davies, Al Murray, Dara Ó Briain and Sandi Toksvig (11 November 2011). "Inland Revenue". QI. Series I. Episode 10. London, England. 19:55 minutes in. BBC. BBC Two.
  60. Sloane, N. J. A. (ed.). "Sequence A048102 (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.
  61. "MOST+MOST Puzzle - Solution".
  62. Sloane, N. J. A. (ed.). "Sequence A000011 (Number of n-bead necklaces (turning over is allowed) where complements are equivalent)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  63. Sloane, N. J. A. (ed.). "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.
  64. Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  65. Sloane, N. J. A. (ed.). "Sequence A112643 (Odd and square-free abundant numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  66. Sloane, N. J. A. (ed.). "Sequence A051015 (Zeisel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  67. Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  68. Sloane, N. J. A. (ed.). "Sequence A007530 (Prime quadruples: numbers k such that k, k+2, k+6, k+8 are all prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  69. ^ "Table of Known Maximal Gaps". Prime Pages.
  70. Sloane, N. J. A. (ed.). "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.
  71. Sloane, N. J. A. (ed.). "Sequence A002104 (Logarithmic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  72. ^ Sloane, N. J. A. (ed.). "Sequence A007597 (Strobogrammatic primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  73. ^ Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  74. Sloane, N. J. A. (ed.). "Sequence A000108 (Catalan numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  75. Sloane, N. J. A. (ed.). "Sequence A088164 (Wolstenholme primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  76. Sloane, N. J. A. (ed.). "Sequence A000112 (Number of partially ordered sets (posets) with n unlabeled elements)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  77. Higgins, Peter (2008). Number Story: From Counting to Cryptography. New York: Copernicus. p. 61. ISBN 978-1-84800-000-1.
  78. Sloane, N. J. A. (ed.). "Sequence A006886 (Kaprekar numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  79. Higgins, ibid.
  80. ^ Sloane, N. J. A. (ed.). "Sequence A001599 (Harmonic or Ore numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  81. Sloane, N. J. A. (ed.). "Sequence A000258 (Expansion of e.g.f. exp(exp(exp(x)-1)-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  82. Sloane, N. J. A. (ed.). "Sequence A000055 (Number of trees with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  83. "Algebra LOGIC 2 Puzzle - Solution".

External links

  •  -1 
  •  0 
  •  1 
  •  2 
  •  3 
  •  4 
  •  5 
  •  6 
  •  7 
  •  8 
  •  9 
1000

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.