50,000 (fifty thousand) is the natural number that comes after 49,999 and before 50,001.
Selected numbers in the range 50001–59999
50001 to 50999
* 50069 = 1
1 + 2
2 + 3
3 + 4
4 + 5
5 + 6
6
* 50400 = 27th
highly composite number
A highly composite number is a positive integer that has more divisors than all smaller positive integers. If ''d''(''n'') denotes the number of divisors of a positive integer ''n'', then a positive integer ''N'' is highly composite if ''d''(' ...
* 50625 = 15
4, smallest fourth power that can be expressed as the sum of only five distinct fourth powers, palindromic in base 14 (14641
14)
* 50653 = 37
3, palindromic in base 6 (1030301
6)
51000 to 51999
* 51076 = 226
2, palindromic in base 15 (10201
15)
* 51641 =
Markov number
A Markov number or Markoff number is a positive integer ''x'', ''y'' or ''z'' that is part of a solution to the Markov Diophantine equation
:x^2 + y^2 + z^2 = 3xyz,\,
studied by .
The first few Markov numbers are
:1 (number), 1, 2 (number), ...
* 51984 = 228
2 = 37
3 + 11
3, the smallest square to the sum of only five distinct fourth powers.
52000 to 52999
* 52488 = 3-
smooth number
In number theory, an ''n''-smooth (or ''n''-friable) number is an integer whose prime factors are all less than or equal to ''n''. For example, a 7-smooth number is a number in which every prime factor is at most 7. Therefore, 49 = 72 and 15750 = 2 ...
* 52633 =
Carmichael number
In number theory, a Carmichael number is a composite number which in modular arithmetic satisfies the congruence relation:
: b^n\equiv b\pmod
for all integers . The relation may also be expressed in the form:
: b^\equiv 1\pmod
for all integers b ...
53000 to 53999
* 53016 =
pentagonal pyramidal number
* 53174 = number of partitions of 42
* 53361 = 231
2 sum of the cubes of the first 21 positive integers
54000 to 54999
* 54205 = Zeisel number
* 54688 = 2-
automorphic number
* 54748 =
narcissistic number
* 54872 = 38
3, palindromic in base 9 (83238
9)
* 54901 =
chiliagonal number
55000 to 55999
* 55296 = 3-
smooth number
In number theory, an ''n''-smooth (or ''n''-friable) number is an integer whose prime factors are all less than or equal to ''n''. For example, a 7-smooth number is a number in which every prime factor is at most 7. Therefore, 49 = 72 and 15750 = 2 ...
* 55440 = the 9th
superior highly composite number
In number theory, a superior highly composite number is a natural number which, in a particular rigorous sense, has many divisors. Particularly, it is defined by a ratio between the number of divisors an integer has and that integer raised to s ...
; the 9th
colossally abundant number, the 28th
highly composite number
A highly composite number is a positive integer that has more divisors than all smaller positive integers. If ''d''(''n'') denotes the number of divisors of a positive integer ''n'', then a positive integer ''N'' is highly composite if ''d''(' ...
.
* 55459 = one of five remaining
Seventeen or Bust numbers in the
Sierpinski problem
* 55555 = repdigit
* 55860 =
harmonic divisor number
* 55987 =
repunit prime in
base 6
56000 to 56999
* 56011 =
Wedderburn-Etherington number
* 56092 = the number of groups of order 256, se
* 56169 = 237
2, palindromic in octal (15551
8)
* 56448 =
pentagonal pyramidal number
57000 to 57999
* 57121 = 239
2, palindromic in base 14 (16B61
14)
58000 to 58999
* 58081 = 241
2, palindromic in base 15 (12321
15)
* 58367 = smallest integer that cannot be expressed as a sum of fewer than 1079 tenth powers
* 58786 =
Catalan number
The Catalan numbers are a sequence of natural numbers that occur in various Enumeration, counting problems, often involving recursion, recursively defined objects. They are named after Eugène Charles Catalan, Eugène Catalan, though they were p ...
* 58921 = Friedman prime
59000 to 59999
* 59049 = 243
2 = 9
5 = 3
10
* 59051 = Friedman prime
* 59053 = Friedman prime
* 59081 = Zeisel number
* 59263 = Friedman prime
* 59273 = Friedman prime
* 59319 = 39
3
* 59536 = 244
2, palindromic in base 11 (40804
11)
Primes
There are 924
prime numbers
A prime number (or a prime) is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways ...
between 50000 and 60000.
References
{{Integers, 10
50000