70,000

In this article we are going to delve into the topic of 70,000, since it is an aspect that has become very relevant in recent times. From various perspectives, 70,000 has impacted society and has generated debates in different areas. That is why it is essential to examine in detail the implications and consequences that 70,000 entails, as well as analyze possible solutions or alternatives. In addition, we will address different opinions from experts in the field, who will highlight relevant aspects that will help to better understand the importance of 70,000 in our current reality.

← 69999 70000 70001 →
Cardinalseventy thousand
Ordinal70000th
(seventy thousandth)
Factorization24 × 54 × 7
Greek numeral
Roman numeralLXX
Binary100010001011100002
Ternary101200001213
Senary13000246
Octal2105608
Duodecimal3461412
Hexadecimal1117016

70,000 (seventy thousand) is the natural number that comes after 69,999 and before 70,001. It is a round number.

Selected numbers in the range 70001–79999

70001 to 70999

  • 70030 = largest number of digits of π that have been recited from memory

71000 to 71999

  • 71656 = pentagonal pyramidal number

72000 to 72999

73000 to 73999

74000 to 74999

  • 74088 = 423 = 23 * 33 * 73
  • 74353 = Friedman prime
  • 74897 = Friedman prime

75000 to 75999

  • 75025 = Fibonacci number, Markov number
  • 75175 = number of partitions of 44
  • 75361 = Carmichael number

76000 to 76999

  • 76084 = amicable number with 63020
  • 76424 = tetranacci number

77000 to 77999

  • 77777 = repdigit
  • 77778 = Kaprekar number

78000 to 78999

  • 78125 = 57
  • 78163 = Friedman prime
  • 78498 = the number of primes under 1,000,000
  • 78557 = conjectured to be the smallest Sierpiński number
  • 78732 = 3-smooth number

79000 to 79999

  • 79507 = 433

Primes

There are 902 prime numbers between 70000 and 80000.

References

  1. ^ Sloane, N. J. A. (ed.). "Sequence A007304 (Sphenic numbers: products of 3 distinct primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. ^ Sloane, N. J. A. (ed.). "Sequence A000217 (Triangular numbers: a(n) = binomial(n+1,2) = n*(n+1)/2 = 0 + 1 + 2 + ... + n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^ Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers: a(n) = n*(2*n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^ "Sloane's A000045 : Fibonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
  5. ^ "Sloane's A002559 : Markoff (or Markov) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
  6. ^ 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.
  7. ^ "Sloane's A002997 : Carmichael numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
  8. ^ "Sloane's A000078 : Tetranacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
  9. ^ "Sloane's A006886 : Kaprekar numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.