30,000

← 29999 30000 30001 →
List of numbers Integers ← 0 10k 20k 30k 40k 50k 60k 70k 80k 90k →
Cardinal	thirty thousand
Ordinal	30000th (thirty thousandth)
Factorization	24 × 3 × 54
Greek numeral	${\displaystyle {\stackrel {\gamma }{\mathrm {M} }}}$
Roman numeral	XXX, xxx
Binary	1110101001100002
Ternary	11120110103
Senary	3505206
Octal	724608
Duodecimal	1544012
Hexadecimal	753016

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

Selected numbers in the range 30001–39999

30001 to 30999

• 30029 = primorial prime
• 30030 = primorial ^[1]
• 30031 = smallest composite number which is one more than a primorial
• 30203 = safe prime
• 30240 = harmonic divisor number, ^[2] smallest 4-perfect number ^[3]
• 30323 = Sophie Germain prime and safe prime
• 30420 = pentagonal pyramidal number ^[4]
• 30537 = Riordan number
• 30694 = open meandric number
• 30941 = first base 13 repunit prime

31000 to 31999

• 31116 = octahedral number ^[5]
• 31185 = number of partitions of 39 ^[6]
• 31337 = cousin prime, pronounced elite, an alternate way to spell 1337 , an obfuscated alphabet made with numbers and punctuation, known and used in the gamer, hacker, and BBS cultures.
• 31395 = square pyramidal number
• 31397 = prime number followed by a record prime gap of 72, the first greater than 52 ^[7]
• 31688 = the number of years approximately equal to 1 trillion seconds
• 31721 = start of a prime quadruplet ^[8]
• 31929 = Zeisel number ^[9]

32000 to 32999

• 32043 = smallest number whose square is pandigital.
• 32045 = can be expressed as a sum of two squares in more ways than any smaller number. ^[10]
• 32760 = harmonic divisor number ^[2]
• 32761 = 181², centered hexagonal number
• 32767 = 2¹⁵− 1, largest positive value for a signed (two's complement) 16-bit integer on a computer.
• 32768 = 2¹⁵ = 8⁵ = 32³, maximum absolute value of a negative value for a signed (two's complement) 16-bit integer on a computer.
• 32800 = pentagonal pyramidal number ^[4]
• 32993 = Leyland prime ^[11] using 2 & 15 (2¹⁵ + 15²)

33000 to 33999

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

34000 to 34999

• 34560 = 5 superfactorial ^[14]
• 34790 = number of non-isomorphic set-systems of weight 13.
• 34841 = start of a prime quadruplet ^[8]
• 34969 = favorite number of the Muppet character Count von Count ^[15]

35000 to 35999

• 35720 = square pyramidal number
• 35840 = number of ounces in a long ton (2,240 pounds)
• 35890 = tribonacci number ^[16]
• 35899 = alternating factorial ^[17]
• 35937 = 33³, chiliagonal number ^[18]
• 35964 = digit-reassembly number

36000 to 36999

• 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

• 37338 = number of partitions of 40 ^[6]
• 37378 = semi-meandric number ^[20]
• 37634 = third term of the Lucas–Lehmer sequence
• 37666 = Markov number ^[13]
• 37926 = pentagonal pyramidal number ^[4]

38000 to 38999

• 38024 = square pyramidal number
• 38209 = n such that n | (3ⁿ + 5) ^[21]
• 38305 = the largest Forges-compatible number (for index 32) to the field ${\displaystyle \mathbb {Q} ({\sqrt {6}},{\sqrt {14}})}$. But a conjecture of Viggo Brun predicts that there are infinitely many such numbers for any Galois field ${\displaystyle F}$ unless ${\displaystyle F}$ is bad.
• 38416 = 14⁴
• 38501 = 7⁴ + 190²: Friedlander-Iwaniec prime. ^[22] Smallest prime separated by at least 40 from the nearest primes (38461 and 38543). It is thus an isolated prime . ^[23] Chen prime. ^[24]
• 38807 = number of non-equivalent ways of expressing 10,000,000 as the sum of two prime numbers ^[25]
• 38962 = Kaprekar number ^[26]

39000 to 39999

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

Primes

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

References

1. Sloane, N. J. A. (ed.). "SequenceA002110(Primorial numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
2. Sloane, N. J. A. (ed.). "SequenceA001599(Harmonic or Ore numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
3. Sloane, N. J. A. (ed.). "SequenceA007539(first n-fold perfect (or n-multiperfect) number)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
4. Sloane, N. J. A. (ed.). "SequenceA002411(Pentagonal pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
5. Sloane, N. J. A. (ed.). "SequenceA005900(Octahedral numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
6. Sloane, N. J. A. (ed.). "SequenceA000041(a(n) is the number of partitions of n (the partition numbers))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
7. Weisstein, Eric W. "Prime Gaps". MathWorld .
8. Sloane, N. J. A. (ed.). "SequenceA007530(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.
9. Sloane, N. J. A. (ed.). "SequenceA051015(Zeisel numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
10. Sloane, N. J. A. (ed.). "SequenceA088959(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.
11. Sloane, N. J. A. (ed.). "SequenceA094133(Leyland prime numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
12. Sloane, N. J. A. (ed.). "SequenceA000129(Pell numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
13. Sloane, N. J. A. (ed.). "SequenceA002559(Markoff (or Markov) numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
14. Sloane, N. J. A. (ed.). "SequenceA000178(Superfactorials)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
15. "Why was 34,969 Count von Count's magic number?". BBC News. 2012-08-30. Retrieved 2012-08-31.
16. Sloane, N. J. A. (ed.). "SequenceA000073(Tribonacci numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
17. Sloane, N. J. A. (ed.). "SequenceA005165(Alternating factorials)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
18. Sloane, N. J. A. (ed.). "SequenceA195163(1000-gonal numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
19. 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.
20. "Sloane's A000682 : Semimeanders". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-15.
21. Sloane, N. J. A. (ed.). "SequenceA277288(Positive integers n such that n | (3^n + 5))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
22. Sloane, N. J. A. (ed.). "SequenceA028916(Friedlander-Iwaniec primes: Primes of form a^2 + b^4)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
23. Sloane, N. J. A. (ed.). "SequenceA023186(Lonely (or isolated) primes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
24. Sloane, N. J. A. (ed.). "SequenceA109611(Chen primes: primes p such that p + 2 is either a prime or a semiprime)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
25. Sloane, N. J. A. (ed.). "SequenceA065577(Number of Goldbach partitions of 10^n)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 2023-08-31.
26. Sloane, N. J. A. (ed.). "SequenceA006886(Kaprekar numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
27. Sloane, N. J. A. (ed.). "SequenceA002770(Weierstrass P-function)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
28. Sloane, N. J. A. (ed.). "SequenceA000078(Tetranacci numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.