Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

30,000

From Wikipedia, the free encyclopedia
Natural number
← 299993000030001 →
Cardinalthirty thousand
Ordinal30000th
(thirty thousandth)
Factorization24 × 3 × 54
Greek numeralMγ{\displaystyle {\stackrel {\gamma }{\mathrm {M} }}}
Roman numeralXXX,xxx
Binary1110101001100002
Ternary11120110103
Senary3505206
Octal724608
Duodecimal1544012
Hexadecimal753016

30,000 (thirty thousand) is thenatural number that comes after 29,999 and before 30,001.

Selected numbers in the range 30001–39999

[edit]

30001 to 30999

[edit]

31000 to 31999

[edit]

32000 to 32999

[edit]

33000 to 33999

[edit]
  • 33333 =repdigit
  • 33461 = Pell number,[12] Markov number[13]
  • 33511 = square pyramidal number
  • 33781 = octahedral number[5]

34000 to 34999

[edit]

35000 to 35999

[edit]

36000 to 36999

[edit]
  • 36100 = sum of the cubes of the first 19 positive integers
  • 36463 – number of parallelogram polyominoes with 14 cells[19]
  • 36594 = octahedral number[5]

37000 to 37999

[edit]

38000 to 38999

[edit]

39000 to 39999

[edit]
  • 39299 = Integer connected with coefficients in expansion of Weierstrass P-function[27]
  • 39304 = 343
  • 39559 = octahedral number[5]
  • 39648 = tetranacci number[28]

Primes

[edit]

There are 958 prime numbers between 30,000 and 40,000.

References

[edit]
  1. ^Sloane, N. J. A. (ed.)."Sequence A002110 (Primorial numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. ^abSloane, N. J. A. (ed.)."Sequence A001599 (Harmonic or Ore numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^Sloane, N. J. A. (ed.)."Sequence A007539 (first n-fold perfect (or n-multiperfect) number)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^abcSloane, N. J. A. (ed.)."Sequence A002411 (Pentagonal pyramidal numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  5. ^abcdSloane, N. J. A. (ed.)."Sequence A005900 (Octahedral numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  6. ^abSloane, 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.
  7. ^Weisstein, Eric W."Prime Gaps".MathWorld.
  8. ^abSloane, N. J. A. (ed.)."Sequence A007530 (Prime quadruples: numbers k such that k, k+2, k+6, k+8 are all prime)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  9. ^Sloane, N. J. A. (ed.)."Sequence A051015 (Zeisel numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  10. ^Sloane, N. J. A. (ed.)."Sequence A088959 (Lowest numbers which are d-Pythagorean decomposable, i.e., square is expressible as sum of two positive squares in more ways than for any smaller number)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  11. ^Sloane, N. J. A. (ed.)."Sequence A094133 (Leyland prime numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  12. ^Sloane, N. J. A. (ed.)."Sequence A000129 (Pell numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  13. ^abSloane, N. J. A. (ed.)."Sequence A002559 (Markoff (or Markov) numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  14. ^Sloane, N. J. A. (ed.)."Sequence A000178 (Superfactorials)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  15. ^"Why was 34,969 Count von Count's magic number?".BBC News. 2012-08-30. Retrieved2012-08-31.
  16. ^Sloane, N. J. A. (ed.)."Sequence A000073 (Tribonacci numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  17. ^Sloane, N. J. A. (ed.)."Sequence A005165 (Alternating factorials)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  18. ^Sloane, N. J. A. (ed.)."Sequence A195163 (1000-gonal numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  19. ^Sloane, N. J. A. (ed.)."Sequence A006958 (Number of parallelogram polyominoes with n cells (also called staircase polyominoes, although that term is overused))".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  20. ^"Sloane's A000682 : Semimeanders".The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2016-06-15.
  21. ^Sloane, N. J. A. (ed.)."Sequence A277288 (Positive integers n such that n | (3^n + 5))".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  22. ^Sloane, N. J. A. (ed.)."Sequence A028916 (Friedlander-Iwaniec primes: Primes of form a^2 + b^4)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  23. ^Sloane, N. J. A. (ed.)."Sequence A023186 (Lonely (or isolated) primes)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  24. ^Sloane, N. J. A. (ed.)."Sequence A109611 (Chen primes: primes p such that p + 2 is either a prime or a semiprime)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  25. ^Sloane, N. J. A. (ed.)."Sequence A065577 (Number of Goldbach partitions of 10^n)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved2023-08-31.
  26. ^Sloane, N. J. A. (ed.)."Sequence A006886 (Kaprekar numbers)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  27. ^Sloane, N. J. A. (ed.)."Sequence A002770 (Weierstrass P-function)".TheOn-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  28. ^Sloane, N. J. A. (ed.)."Sequence A000078 (Tetranacci numbers)".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=30,000&oldid=1321209748"
Category:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp