Jump to content

30,000

From Wikipedia, the free encyclopedia
(Redirected from 32767)
← 29999 30000 30001 →
Cardinalthirty thousand
Ordinal30000th
(thirty thousandth)
Factorization24 × 3 × 54
Greek numeral
Roman numeralXXX
Binary1110101001100002
Ternary11120110103
Senary3505206
Octal724608
Duodecimal1544012
Hexadecimal753016

30000 (thirty thousand) is the natural 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,[11] Markov number[12]
  • 33511 = square pyramidal number
  • 33781 = octahedral number[4]

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[18]
  • 36594 = octahedral number[4]

37000 to 37999

[edit]

38000 to 38999

[edit]
  • 38024 = square pyramidal number
  • 38209 = n such that n | (3n + 5)[20]
  • 38305 = the largest Forges-compatible number (for index 32) to the field . But a conjecture of Viggo Brun predicts that there are infinitely many such numbers for any Galois field unless is bad.
  • 38416 = 144
  • 38501 = 74 + 1902: Friedlander-Iwaniec prime.[21] Smallest prime separated by at least 40 from the nearest primes (38461 and 38543). It is thus an isolated prime.[22] Chen prime.[23]
  • 38807 = number of non-equivalent ways of expressing 10,000,000 as the sum of two prime numbers[24]
  • 38962 = Kaprekar number[25]

39000 to 39999

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

Primes

[edit]

There are 958 prime numbers between 30000 and 40000.

References

[edit]
  1. ^ Sloane, N. J. A. (ed.). "Sequence A002110 (Primorial numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. ^ a b Sloane, N. J. A. (ed.). "Sequence A001599 (Harmonic or Ore numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^ a b c Sloane, N. J. A. (ed.). "Sequence A002411 (Pentagonal pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A005900 (Octahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  5. ^ a b 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.
  6. ^ Weisstein, Eric W. "Prime Gaps". MathWorld.
  7. ^ a b 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.
  8. ^ Sloane, N. J. A. (ed.). "Sequence A051015 (Zeisel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  9. ^ 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  10. ^ Sloane, N. J. A. (ed.). "Sequence A094133 (Leyland prime numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  11. ^ Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  12. ^ a b Sloane, N. J. A. (ed.). "Sequence A002559 (Markoff (or Markov) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  13. ^ Sloane, N. J. A. (ed.). "Sequence A000178 (Superfactorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  14. ^ "Why was 34,969 Count von Count's magic number?". BBC News. 2012-08-30. Retrieved 2012-08-31.
  15. ^ Sloane, N. J. A. (ed.). "Sequence A000073 (Tribonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  16. ^ Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  17. ^ Sloane, N. J. A. (ed.). "Sequence A195163 (1000-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  18. ^ 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.
  19. ^ "Sloane's A000682 : Semimeanders". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-15.
  20. ^ Sloane, N. J. A. (ed.). "Sequence A277288 (Positive integers n such that n | (3^n + 5))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  21. ^ Sloane, N. J. A. (ed.). "Sequence A028916 (Friedlander-Iwaniec primes: Primes of form a^2 + b^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  22. ^ Sloane, N. J. A. (ed.). "Sequence A023186 (Lonely (or isolated) primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  23. ^ Sloane, N. J. A. (ed.). "Sequence A109611 (Chen primes: primes p such that p + 2 is either a prime or a semiprime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  24. ^ Sloane, N. J. A. (ed.). "Sequence A065577 (Number of Goldbach partitions of 10^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-08-31.
  25. ^ Sloane, N. J. A. (ed.). "Sequence A006886 (Kaprekar numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  26. ^ Sloane, N. J. A. (ed.). "Sequence A002770 (Weierstrass P-function)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  27. ^ Sloane, N. J. A. (ed.). "Sequence A000078 (Tetranacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.