70,000
Appearance
| ||||
---|---|---|---|---|
Cardinal | seventy thousand | |||
Ordinal | 70000th (seventy thousandth) | |||
Factorization | 24× 54× 7 | |||
Greek numeral | ||||
Roman numeral | LXX | |||
Binary | 100010001011100002 | |||
Ternary | 101200001213 | |||
Senary | 13000246 | |||
Octal | 2105608 | |||
Duodecimal | 3461412 | |||
Hexadecimal | 1117016 |
70,000(seventy thousand) is thenatural numberthat comes after69,999and before 70,001. It is a round number.
Selected numbers in the range 70001–79999[edit]
70001 to 70999[edit]
- 70030= largest number of digits ofπthat have been recited from memory
71000 to 71999[edit]
- 71656= pentagonal pyramidal number
72000 to 72999[edit]
- 72771= 3 x 127 x 191, is asphenic number,[1]triangular number,[2]andhexagonal number.[3]
73000 to 73999[edit]
- 73296= is the smallest numbern,for whichn−3,n−2,n−1,n+1,n+2,n+3 are allSphenic number.
- 73440= 15 × 16 × 17 × 18
- 73712= number ofn-Queens Problemsolutions forn= 13
- 73728= 3-smooth number
74000 to 74999[edit]
- 74088= 423= 23* 33* 73
- 74353= Friedman prime
- 74897= Friedman prime
75000 to 75999[edit]
- 75025= Fibonacci number,[4]Markov number[5]
- 75175= number of partitions of 44[6]
- 75361= Carmichael number[7]
76000 to 76999[edit]
- 76084= amicable number with 63020
- 76424= tetranacci number[8]
77000 to 77999[edit]
- 77777= repdigit
- 77778= Kaprekar number[9]
78000 to 78999[edit]
- 78125= 57
- 78163= Friedman prime
- 78498= the number of primes under 1,000,000
- 78557= conjectured to be the smallestSierpiński number
- 78732= 3-smooth number
79000 to 79999[edit]
- 79507= 433
Primes[edit]
There are 902 prime numbers between 70000 and 80000.
References[edit]
- ^Sloane, N. J. A.(ed.)."Sequence A007304 (Sphenic numbers: products of 3 distinct primes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A000217 (Triangular numbers: a(n) = binomial(n+1,2) = n*(n+1)/2 = 0 + 1 + 2 +... + n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A000384 (Hexagonal numbers: a(n) = n*(2*n-1))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^"Sloane's A000045: Fibonacci numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-16.
- ^"Sloane's A002559: Markoff (or Markov) numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-16.
- ^Sloane, N. J. A.(ed.)."Sequence A000041 (a(n) is the number of partitions of n (the partition numbers).)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^"Sloane's A002997: Carmichael numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-16.
- ^"Sloane's A000078: Tetranacci numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-16.
- ^"Sloane's A006886: Kaprekar numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-16.