From Wikipedia, the free encyclopedia
Natural number
40,000 (forty thousand) is the
natural number that comes after 39,999 and before 40,001. It is the square of 200.
Selected numbers in the range 40001–49999
40001 to 40999
41000 to 41999
42000 to 42999
43000 to 43999
- 43261 =
Markov number
[10]
- 43380 = number of nets of a dodecahedron
- 43390 = number of primes .
[11]
- 43560 = pentagonal pyramidal number
- 43691 =
Wagstaff prime
[12]
- 43777 = smallest member of a prime sextuplet
44000 to 44999
- 44044 = palindrome of
79 after 6 iterations of the "reverse and add" iterative process
[13]
- 44100 = sum of the cubes of the first 20 positive integers
44,100 Hz is a common
sampling frequency in digital audio (and is the standard for
compact discs).
- 44444 =
repdigit
- 44583 = number of partitions of 41
[14]
- 44721 = smallest positive integer such that the expression 1/n − 1/n + 2 ≤ 10−9
- 44724 = maximum number of days in which a human being has been verified to live (
Jeanne Calment).
[15]
- 44944 = palindromic square
45000 to 45999
46000 to 46999
47000 to 47999
48000 to 48999
- 48629 = number of trees with 17 unlabeled nodes
[21]
- 48734 = number of 22-bead necklaces (turning over is allowed) where complements are equivalent
[22]
49000 to 49999
- 49151 =
Woodall number
[23]
- 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
[24]
Primes
There are 930 prime numbers between 40000 and 50000.
References
-
^
"Sloane's A014080 : Factorions". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-15.
-
^
Sloane, N. J. A. (ed.).
"Sequence A000217 (Triangular numbers)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
-
^
Sloane, N. J. A. (ed.).
"Sequence A000326 (Pentagonal numbers)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
-
^
Sloane, N. J. A. (ed.).
"Sequence A000384 (Hexagonal numbers)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ^
a
b
"Sloane's A002997 : Carmichael numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-15.
-
^
Sloane, N. J. A. (ed.).
"Sequence A000014 (Number of series-reduced trees with n nodes)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
-
^
"Sloane's A001110 : Square triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-15.
-
^
"Sloane's A001006 : Motzkin numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-15.
-
^
"Sloane's A005900 : Octahedral numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-15.
-
^
"Sloane's A002559 : Markoff (or Markov) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-15.
-
^
Sloane, N. J. A. (ed.).
"Sequence A007053 (Number of primes <= 2^n)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
-
^
Sloane, N. J. A. (ed.).
"Sequence A000979 (Wagstaff primes)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
-
^
"Reversal-Addition Palindrome Test on 79".
-
^
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.
-
^ Amzallag, William.
"The Promise of Immortality". books/google.com. Varegus Publishing. Retrieved September 22, 2016.
-
^
Sloane, N. J. A. (ed.).
"Sequence A002182 (Highly composite numbers)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
-
^
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)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
-
^
Sloane, N. J. A. (ed.).
"Sequence A000045 (Fibonacci numbers)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
-
^
Sloane, N. J. A. (ed.).
"Sequence A054377 (Primary pseudoperfect numbers)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
-
^
Sloane, N. J. A. (ed.).
"Sequence A005727 (n-th derivative of x^x at x=1. Also called Lehmer-Comtet numbers)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
-
^
Sloane, N. J. A. (ed.).
"Sequence A000055 (Number of trees with n unlabeled nodes)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
-
^
Sloane, N. J. A. (ed.).
"Sequence A000011 (Number of n-bead necklaces (turning over is allowed) where complements are equivalent)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
-
^
Sloane, N. J. A. (ed.).
"Sequence A003261 (Woodall numbers)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
-
^
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)". The
On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
|
---|
|
|
|
|
|
|
|
|
|
|
|
---|
| |
-
100,000
-
1,000,000
-
10,000,000
-
100,000,000
-
1,000,000,000
|
|