BETA ZEN
70,000
Texto da Wikipédia (en), licença CC BY-SA. O BETARUBI mostra o verbete inteiro nesta página — a leitura não continua fora do site.
| ||||
|---|---|---|---|---|
| Cardinal | seventy thousand | |||
| Ordinal | 70000th (seventy thousandth) | |||
| Factorization | 24 × 54 × 7 | |||
| Greek numeral | ||||
| Roman numeral | LXX, lxx | |||
| Binary | 100010001011100002 | |||
| Ternary | 101200001213 | |||
| Senary | 13000246 | |||
| Octal | 2105608 | |||
| Duodecimal | 3461412 | |||
| Hexadecimal | 1117016 | |||
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
- 70030 = largest number of digits of π that have been recited from memory
- 71656 = pentagonal pyramidal number
- 72771 = 3 x 127 x 191, is a sphenic number,[1] triangular number,[2] and hexagonal number.[3]
- 73296 = is the smallest number n, for which n−3, n−2, n−1, n+1, n+2, n+3 are all Sphenic number.
- 73440 = 15 × 16 × 17 × 18 (can also be written as 18! ÷ 14! or 18!/14!)
- 73712 = number of n-Queens Problem solutions for n = 13
- 73728 = 3-smooth number
- 74353 = Friedman prime
- 74897 = Friedman prime
- 75025 = Fibonacci number,[4] Markov number[5]
- 75175 = number of partitions of 44 [6]
- 75361 = Carmichael number[7]
- 76084 = amicable number with 63020
- 76424 = tetranacci number[8]
- 77778 = Kaprekar number[9]
- 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
Primes
There are 902 prime numbers between 70000 and 80000.
References
- ↑ Sloane, N. J. A. (ed.). "Sequence A007304 (Sphenic numbers: products of 3 distinct primes)". The On-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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers: a(n) = n*(2*n-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ "Sloane's A000045 : Fibonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
- ↑ "Sloane's A002559 : Markoff (or Markov) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
- ↑ 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.
- ↑ "Sloane's A002997 : Carmichael numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
- ↑ "Sloane's A000078 : Tetranacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
- ↑ "Sloane's A006886 : Kaprekar numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
