Jump to content

80,000

From Wikipedia, the free encyclopedia
← 79999 80000 80001 →
Cardinaleighty thousand
Ordinal80000th
(eighty thousandth)
Factorization27 × 54
Greek numeral
Roman numeralLXXX, lxxx
Binary100111000100000002
Ternary110012012223
Senary14142126
Octal2342008
Duodecimal3A36812
Hexadecimal1388016

80,000 (eighty thousand) is the natural number after 79,999 and before 80,001.

In mathematics

[edit]

80,000 is an odd composite number, that is a regular number.[1]

In other fields

[edit]

Since January 2024, the daily URL save limit for YouTube for the Wayback Machine is 80,000.[citation needed]

Selected numbers in the range 80,000–89,999

[edit]
  • 80,782 = Pell number P14[2]
  • 81,081 = smallest abundant number ending in 1, 3, 7, or 9
  • 81,181 = number of reduced trees with 25 nodes[3]
  • 82,000 = the only currently known number greater than 1 that can be written in bases from 2 through 5 using only 0s and 1s.[4][5]
  • 82,025 = number of primes .[6]
  • 82,467 = number of square (0,1)-matrices without zero rows and with exactly 6 entries equal to 1[7]
  • 82,656 = Kaprekar number: 826562 = 6832014336; 68320 + 14336 = 82656[8]
  • 82,944 = 3-smooth number: 210 × 34
  • 83,097 = Riordan number
  • 83,160 = the 29th highly composite number[9]
  • 83,357 = Friedman prime[10]
  • 84,672 = number of primitive polynomials of degree 21 over GF(2)[11]
  • 85,085 = product of five consecutive primes: 5 × 7 × 11 × 13 × 17
  • 87,360 = unitary perfect number[12]
  • 88,789 = the start of a prime 9-tuple, along with 88793, 88799, 88801, 88807, 88811, 88813, 88817, and 88819.
  • 89,134 = number of partitions of 45[13]

Primes

[edit]

There are 876 prime numbers between 80,000 and 90,000.

See also

[edit]
  • 80,000 Hours, a British social impact career advisory organization

References

[edit]
  1. ↑ Vanovschi, Vitalii. "Properties of the number 80000". www.numberempire.com. Retrieved 2026-09-25.
  2. ↑ Sloane, N. J. A. (ed.). "Sequence A000129 (Pell numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
  3. ↑ Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ↑ Sequence A146025 in The On-Line Encyclopedia of Integer Sequences
  5. ↑ Sequence A258107 in The On-Line Encyclopedia of Integer Sequences
  6. ↑ Sloane, N. J. A. (ed.). "Sequence A007053 (Number of primes <= 2^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-02.
  7. ↑ Sloane, N. J. A. (ed.). "Sequence A122400 (Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  8. ↑ Sloane, N. J. A. (ed.). "Sequence A006886 (Kaprekar numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
  9. ↑ Sloane, N. J. A. (ed.). "Sequence A002182 (Highly composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
  10. ↑ (sequence A112419 in the OEIS)
  11. ↑ Sloane, N. J. A. (ed.). "Sequence A011260 (Number of primitive polynomials of degree n over GF(2))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  12. ↑ Sloane, N. J. A. (ed.). "Sequence A002827 (Unitary perfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
  13. ↑ 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.