60,000: Difference between revisions
Appearance
Content deleted Content added
m Reverted edits by 2405:205:2007:C7E3:0:0:1189:20A1 (talk) to last version by PrimeHunter |
→Selected numbers in the range 60000–69999: only five left in Sierpiński |
||
Line 32: | Line 32: | ||
* '''66666''' – [[repdigit]] |
* '''66666''' – [[repdigit]] |
||
* '''67081''' – 259<sup>2</sup>, palindromic in base 6 (1234321<sub>6</sub>) |
* '''67081''' – 259<sup>2</sup>, palindromic in base 6 (1234321<sub>6</sub>) |
||
* '''67607''' – largest of |
* '''67607''' – largest of five remaining [[Seventeen or Bust]] numbers in the [[Sierpinski number|Sierpiński problem]] |
||
* '''67626''' – pentagonal pyramidal number |
* '''67626''' – pentagonal pyramidal number |
||
* '''68000''' – [[Motorola 68000]], a [[microprocessor|processor]] used in [[Apple Macintosh]] computers before [[PowerPC]] (also 68k processor family) |
* '''68000''' – [[Motorola 68000]], a [[microprocessor|processor]] used in [[Apple Macintosh]] computers before [[PowerPC]] (also 68k processor family) |
Revision as of 23:57, 6 November 2016
| ||||
---|---|---|---|---|
Cardinal | sixty thousand | |||
Ordinal | 60000th (sixty thousandth) | |||
Factorization | 25 × 3 × 54 | |||
Greek numeral | ||||
Roman numeral | LX | |||
Binary | 11101010011000002 | |||
Ternary | 100010220203 | |||
Senary | 11414406 | |||
Octal | 1651408 | |||
Duodecimal | 2A88012 | |||
Hexadecimal | EA6016 |
60,000 (sixty thousand) is the natural number that comes after 59,999 and before 60,001.
Selected numbers in the range 60000–69999
- 60000 – round number
- 60049 – Leyland number[1]
- 62210 – Markov number[2]
- 62745 – Carmichael number[3]
- 63020 – amicable number with 76084
- 63360 – inches in a mile
- 63750 – pentagonal pyramidal number
- 63973 – Carmichael number[3]
- 64000 – 403
- 64009 – sum of the cubes of the first 22 positive integers
- 64079 – Lucas number
- 65023 – Carol number[4]
- 65025 – 2552, palindromic in base 11 (4494411)
- 65279 – Unicode code point for byte order mark
- 65534 – Unicode code point guaranteed not to be a character
- 65535 – largest value for an unsigned 16-bit integer on a computer.
- 65536 – 216, also 2↑↑4 using Knuth's up-arrow notation, smallest integer with exactly 17 divisors. palindromic in base 15 (1464115)
- 65537 – Fermat prime
- 65539 – the 6544th prime number, and both 6544 and 65539 have digital root of 1; a regular prime; a larger member of a twin prime pair; a smaller member of a cousin prime pair; a happy prime; a weak prime; a middle member of a prime triplet, (65537, 65539, 65543); a middle member of a three-term primes in arithmetic progression, (65521, 65539, 65557).
- 65792 – Leyland number[1]
- 66012 – tribonacci number[5]
- 66047 – Kynea number[6]
- 66049 – 2572, palindromic in hexadecimal (1020116)
- 66198 – Giuga number[7]
- 66666 – repdigit
- 67081 – 2592, palindromic in base 6 (12343216)
- 67607 – largest of five remaining Seventeen or Bust numbers in the Sierpiński problem
- 67626 – pentagonal pyramidal number
- 68000 – Motorola 68000, a processor used in Apple Macintosh computers before PowerPC (also 68k processor family)
- 68008 – Motorola 68008, a processor used in Sinclair QL computer
- 68020 – Motorola 68020, a processor used in Apple Macintosh computers before PowerPC
- 68030 – Motorola 68030, a processor used in Apple Macintosh computers before PowerPC
- 68040 – Motorola 68040, a processor used in Apple Macintosh computers before PowerPC
- 68881 – Motorola 68881, a math coprocessor used in with 68020 and 68030
- 68882 – Motorola 68881, a math coprocessor used in with 68020 and 68030
- 69105 – Infocom in-joke
- 69632 – Leyland number[1]
- 69696 – square of 264; only known palindromic square that can be expressed as the sum of a pair of twin primes: 69696 = 34847 + 34849.
References
- ^ a b c "Sloane's A076980 : Leyland 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.
- ^ a b "Sloane's A002997 : Carmichael numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
- ^ "Sloane's A093112 : a(n) = (2^n-1)^2 - 2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
- ^ "Sloane's A000073 : Tribonacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
- ^ "Sloane's A093069 : a(n) = (2^n + 1)^2 - 2". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.
- ^ "Sloane's A007850 : Giuga numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-16.