Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

40,000

From Wikipedia, the free encyclopedia
"40k" redirects here. For the tabletop game, seeWarhammer 40,000. For the isotope40K, seePotassium-40.
Natural number
← 399994000040001 →
Cardinalforty thousand
Ordinal40000th
(forty thousandth)
Factorization26 × 54
Divisors35 total
Greek numeralMδ{\displaystyle {\stackrel {\delta }{\mathrm {M} }}}
Roman numeralXL,xl
Binary10011100010000002
Ternary20002121113
Senary5051046
Octal1161008
Duodecimal1B19412
Hexadecimal9C4016

40,000 (forty thousand) is thenatural number that comes after 39,999 and before 40,001. It is the square of 200.

Selected numbers in the range 40001–49999

[edit]

40001 to 40999

[edit]

41000 to 41999

[edit]

42000 to 42999

[edit]

43000 to 43999

[edit]

44000 to 44999

[edit]
  • 44044 = palindrome of79 after 6 iterations of the "reverse and add" iterative process[14]
  • 44100 = sum of the cubes of the first 20 positive integers44,100 Hz is a commonsampling frequency in digital audio (and is the standard forcompact discs).
  • 44444 =repdigit
  • 44583 = number of partitions of 41[15]
  • 44721 = smallest positive integer such that the expression1/n1/n + 2 ≤ 10−9
  • 44724 = maximum number of days in which a human being has been verified to live (Jeanne Calment).[16]
  • 44944 = palindromic square

45000 to 45999

[edit]

46000 to 46999

[edit]

47000 to 47999

[edit]

48000 to 48999

[edit]
  • 48629 = number of trees with 17 unlabeled nodes[22]
  • 48734 = number of 22-bead necklaces (turning over is allowed) where complements are equivalent[23]

49000 to 49999

[edit]
  • 49151 =Woodall number[24]
  • 49152 = 3-smooth number
  • 49726 = pentagonal pyramidal number
  • 49940 = number of 21-bead binary necklaces with beads of 2 colors where the colors may be swapped but turning over is not allowed[25]

Primes

[edit]

There are 930 prime numbers between 40000 and 50000.

References

[edit]
  1. ^"Sloane's A014080 : Factorions".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-06-15.
  2. ^"A046180 - OEIS".oeis.org. Retrieved2024-12-18.
  3. ^Sloane, N. J. A. (ed.)."Sequence A000217 (Triangular numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^Sloane, N. J. A. (ed.)."Sequence A000326 (Pentagonal numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  5. ^Sloane, N. J. A. (ed.)."Sequence A000384 (Hexagonal numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  6. ^ab"Sloane's A002997 : Carmichael numbers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-06-15.
  7. ^Sloane, N. J. A. (ed.)."Sequence A000014 (Number of series-reduced trees with n nodes)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  8. ^"Sloane's A001110 : Square triangular numbers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-06-15.
  9. ^"Sloane's A001006 : Motzkin numbers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-06-15.
  10. ^"Sloane's A005900 : Octahedral numbers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-06-15.
  11. ^"Sloane's A002559 : Markoff (or Markov) numbers".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-06-15.
  12. ^Sloane, N. J. A. (ed.)."Sequence A007053 (Number of primes <= 2^n)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  13. ^Sloane, N. J. A. (ed.)."Sequence A000979 (Wagstaff primes)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  14. ^"Reversal-Addition Palindrome Test on 79".
  15. ^Sloane, N. J. A. (ed.)."Sequence A000041 (a(n) is the number of partitions of n (the partition numbers))".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  16. ^Amzallag, William (22 September 2016).The Promise of Immortality. Varegus Publishing. p. 12.ISBN 978-2-9558558-1-2. RetrievedSeptember 22, 2016.
  17. ^Sloane, N. J. A. (ed.)."Sequence A002182 (Highly composite numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  18. ^Sloane, N. J. A. (ed.)."Sequence A359013 (Numbers k that can be written as the sum of a perfect square and a factorial in exactly 3 distinct ways)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  19. ^Sloane, N. J. A. (ed.)."Sequence A000045 (Fibonacci numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  20. ^Sloane, N. J. A. (ed.)."Sequence A054377 (Primary pseudoperfect numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  21. ^Sloane, N. J. A. (ed.)."Sequence A005727 (n-th derivative of x^x at x=1. Also called Lehmer-Comtet numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  22. ^Sloane, N. J. A. (ed.)."Sequence A000055 (Number of trees with n unlabeled nodes)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  23. ^Sloane, N. J. A. (ed.)."Sequence A000011 (Number of n-bead necklaces (turning over is allowed) where complements are equivalent)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  24. ^Sloane, N. J. A. (ed.)."Sequence A003261 (Woodall numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  25. ^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)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
0 to 199
200 to 399
400 to 999
1000s and 10,000s
1000s
10,000s
100,000s to 10,000,000,000,000s
Retrieved from "https://en.wikipedia.org/w/index.php?title=40,000&oldid=1319744102"
Category:
Hidden categories:

[8]ページ先頭

©2009-2026 Movatter.jp