| ||||
---|---|---|---|---|
Cardinal | thirty thousand | |||
Ordinal | 30000th (thirty thousandth) | |||
Factorization | 24 × 3 × 54 | |||
Greek numeral | ||||
Roman numeral | 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
[edit]30001 to 30999
[edit]- 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]
- 30323 = Sophie Germain prime and safe prime
- 30420 = pentagonal pyramidal number[3]
- 30537 = Riordan number
- 30694 = open meandric number
- 30941 = first base 13 repunit prime
31000 to 31999
[edit]- 31116 = octahedral number[4]
- 31185 = number of partitions of 39[5]
- 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[6]
- 31688 = the number of years approximately equal to 1 trillion seconds
- 31721 = start of a prime quadruplet[7]
- 31929 = Zeisel number[8]
32000 to 32999
[edit]- 32043 = smallest number whose square is pandigital.
- 32045 = can be expressed as a sum of two squares in more ways than any smaller number.[9]
- 32760 = harmonic divisor number[2]
- 32761 = 1812, centered hexagonal number
- 32767 = 215 − 1, largest positive value for a signed (two's complement) 16-bit integer on a computer.
- 32768 = 215 = 85 = 323, maximum absolute value of a negative value for a signed (two's complement) 16-bit integer on a computer.
- 32800 = pentagonal pyramidal number[3]
- 32993 = Leyland number[10]
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]- 34560 = 5 superfactorial[13]
- 34790 = number of non-isomorphic set-systems of weight 13.
- 34841 = start of a prime quadruplet[7]
- 34969 = favorite number of the Muppet character Count von Count[14]
35000 to 35999
[edit]- 35720 = square pyramidal number
- 35840 = number of ounces in a long ton (2,240 pounds)
- 35890 = tribonacci number[15]
- 35899 = alternating factorial[16]
- 35937 = 333, chiliagonal number[17]
- 35964 = digit-reassembly number
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]- 37338 = number of partitions of 40[5]
- 37378 = semi-meandric number[19]
- 37634 = third term of the Lucas–Lehmer sequence
- 37666 = Markov number[12]
- 37926 = pentagonal pyramidal number[3]
38000 to 38999
[edit]- 38024 = square pyramidal number
- 38209 = n such that n | (3n + 5)[20]
- 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]- ^ Sloane, N. J. A. (ed.). "Sequence A002110 (Primorial numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ a b Sloane, N. J. A. (ed.). "Sequence A001599 (Harmonic or Ore numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ a b c Sloane, N. J. A. (ed.). "Sequence A002411 (Pentagonal pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ a b c d Sloane, N. J. A. (ed.). "Sequence A005900 (Octahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ 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.
- ^ Weisstein, Eric W. "Prime Gaps". MathWorld.
- ^ 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.
- ^ Sloane, N. J. A. (ed.). "Sequence A051015 (Zeisel numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ 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.
- ^ Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ a b Sloane, N. J. A. (ed.). "Sequence A002559 (Markoff (or Markov) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A000178 (Superfactorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ "Why was 34,969 Count von Count's magic number?". BBC News. 2012-08-30. Retrieved 2012-08-31.
- ^ Sloane, N. J. A. (ed.). "Sequence A000073 (Tribonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A195163 (1000-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ 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.
- ^ "Sloane's A000682 : Semimeanders". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-15.
- ^ 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.
- ^ 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.
- ^ Sloane, N. J. A. (ed.). "Sequence A023186 (Lonely (or isolated) primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ 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.
- ^ 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.
- ^ Sloane, N. J. A. (ed.). "Sequence A006886 (Kaprekar numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A002770 (Weierstrass P-function)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^ Sloane, N. J. A. (ed.). "Sequence A000078 (Tetranacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.