Jump to content

600 (number)

From Wikipedia, the free encyclopedia
(Redirected from 687 (number))
← 599 600 601 ⊟
Cardinalsix hundred
Ordinal600th
(six hundredth)
Factorization23 × 3 × 52
Divisors1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 25, 30, 40, 50, 60, 75, 100, 120, 150, 200, 300, 600
Greek numeralΧ´
Roman numeralDC
Binary10010110002
Ternary2110203
Senary24406
Octal11308
Duodecimal42012
Hexadecimal25816
ArmenianՈ
Hebrewת"ר / ם
Babylonian cuneiform𒌋
Egyptian hieroglyph𓍧

600 (six hundred) is the natural number following 599 and preceding 601.

Mathematical properties

[edit]

Six hundred is a composite number, an abundant number, a pronic number,[1] a Harshad number and a largely composite number.[2]

Credit and cars

[edit]
  • In the United States, a credit score of 600 or below is considered poor, limiting available credit at a normal interest rate
  • NASCAR runs 600 advertised miles in the Coca-Cola 600, its longest race
  • The Fiat 600 is a car, the SEAT 600 its Spanish version

Integers from 601 to 699

[edit]

600s

[edit]

610s

[edit]

620s

[edit]

630s

[edit]

640s

[edit]

650s

[edit]

660s

[edit]

670s

[edit]

680s

[edit]
  • 680 = 23 × 5 × 17, tetrahedral number,[61] nontotient
  • 681 = 3 × 227, centered pentagonal number[3]
  • 682 = 2 × 11 × 31, sphenic number, sum of four consecutive primes (163 167 173 179), sum of ten consecutive primes (47 53 59 61 67 71 73 79 83 89), number of moves to solve the Norwegian puzzle strikketoy[62]
  • 683 = prime number, Sophie Germain prime,[37] sum of five consecutive primes (127 131 137 139 149), Chen prime, Eisenstein prime with no imaginary part, Wagstaff prime[63]
  • 684 = 22 × 32 × 19, Harshad number, number of graphical forest partitions of 32[64]
  • 685 = 5 × 137, centered square number[65]
  • 686 = 2 × 73, nontotient, number of multigraphs on infinite set of nodes with 7 edges[66]
  • 687 = 3 × 229, 687 days to orbit the Sun (Mars) D-number[67]
  • 688 = 24 × 43, Friedman number since 688 = 8 × 86,[20] 2-automorphic number[68]
  • 689 = 13 × 53, sum of three consecutive primes (227 229 233), sum of seven consecutive primes (83 89 97 101 103 107 109). Strobogrammatic number[69]

690s

[edit]
  • 690 = 2 × 3 × 5 × 23, sum of six consecutive primes (103 107 109 113 127 131), sparsely totient number,[27] Smith number,[22] Harshad number
    • ISO 690 is the ISO's standard for bibliographic references
  • 691 = prime number, (negative) numerator of the Bernoulli number B12 = -691/2730. Ramanujan's tau function τ and the divisor function σ11 are related by the remarkable congruence τ(n) ≡ σ11(n) (mod 691).
    • In number theory, 691 is a "marker" (similar to the radioactive markers in biology): whenever it appears in a computation, one can be sure that Bernoulli numbers are involved.
  • 692 = 22 × 173, number of partitions of 48 into powers of 2[70]
  • 693 = 32 × 7 × 11, triangular matchstick number,[71] the number of sections in Ludwig Wittgenstein's Philosophical Investigations.
  • 694 = 2 × 347, centered triangular number,[29] nontotient, smallest pandigital number in base 5.[72]
  • 695 = 5 × 139, 695!! 2 is prime.[73]
  • 696 = 23 × 3 × 29, sum of a twin prime (347 349) sum of eight consecutive primes (71 73 79 83 89 97 101 103), totient sum for first 47 integers, trails of length 9 on honeycomb lattice[74]
  • 697 = 17 × 41, cake number; the number of sides of Colorado[75]
  • 698 = 2 × 349, nontotient, sum of squares of two primes[76]
  • 699 = 3 × 233, D-number[67]

References

[edit]
  1. ^ a b Sloane, N. J. A. (ed.). "Sequence A002378 (Oblong (or promic, pronic, or heteromecic) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A067128 (Ramanujan's largely composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ^ a b Sloane, N. J. A. (ed.). "Sequence A005891 (Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^ a b Sloane, N. J. A. (ed.). "Sequence A006562 (Balanced primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  5. ^ a b Sloane, N. J. A. (ed.). "Sequence A016038 (Strictly non-palindromic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  6. ^ a b Sloane, N. J. A. (ed.). "Sequence A331452 (Triangle read by rows: T(n,m) (n >= m >= 1) = number of regions (or cells) formed by drawing the line segments connecting any two of the 2*(m n) perimeter points of an m X n grid of squares)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  7. ^ Sloane, N. J. A. (ed.). "Sequence A000787 (Strobogrammatic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  8. ^ Sloane, N. J. A. (ed.). "Sequence A000045 (Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  9. ^ Sloane, N. J. A. (ed.). "Sequence A002559 (Markoff (or Markov) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  10. ^ a b Sloane, N. J. A. (ed.). "Sequence A001606 (Indices of prime Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  11. ^ Sloane, N. J. A. (ed.). "Sequence A020492 (Balanced numbers: numbers k such that phi(k) (A000010) divides sigma(k) (A000203))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  12. ^ Sloane, N. J. A. (ed.). "Sequence A032020 (Number of compositions (ordered partitions) of n into distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  13. ^ Sloane, N. J. A. (ed.). "Sequence A007597 (Strobogrammatic primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  14. ^ Sloane, N. J. A. (ed.). "Sequence A005165 (Alternating factorials)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  15. ^ OEISA013916
  16. ^ Sloane, N. J. A. (ed.). "Sequence A006832 (Discriminants of totally real cubic fields)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  17. ^ Sloane, N. J. A. (ed.). "Sequence A027187 (Number of partitions of n into an even number of parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  18. ^ Sloane, N. J. A. (ed.). "Sequence A059377 (Jordan function J_4(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  19. ^ Sloane, N. J. A. (ed.). "Sequence A016754 (Odd squares: a(n) = (2n 1)^2. Also centered octagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  20. ^ a b Sloane, N. J. A. (ed.). "Sequence A036057 (Friedman numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  21. ^ Sloane, N. J. A. (ed.). "Sequence A000041 (a(n) = number of partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  22. ^ a b c d e f g Sloane, N. J. A. (ed.). "Sequence A006753 (Smith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  23. ^ a b Sloane, N. J. A. (ed.). "Sequence A100827 (Highly cototient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  24. ^ a b Sloane, N. J. A. (ed.). "Sequence A000096 (a(n) = n*(n 3)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  25. ^ "A000217 - OEIS". oeis.org. Retrieved 2024-11-29.
  26. ^ Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  27. ^ a b c Sloane, N. J. A. (ed.). "Sequence A036913 (Sparsely totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  28. ^ Sloane, N. J. A. (ed.). "Sequence A020492 (Balanced numbers: numbers k such that phi(k) (A000010) divides sigma(k) (A000203))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  29. ^ a b Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  30. ^ Sloane, N. J. A. (ed.). "Sequence A003215 (Hex (or centered hexagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  31. ^ Sloane, N. J. A. (ed.). "Sequence A000031 (Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  32. ^ Sloane, N. J. A. (ed.). "Sequence A101268 (Number of compositions of n into pairwise relatively prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-31.
  33. ^ Sloane, N. J. A. (ed.). "Sequence A001107 (10-gonal (or decagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  34. ^ Sloane, N. J. A. (ed.). "Sequence A069099 (Centered heptagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  35. ^ Sloane, N. J. A. (ed.). "Sequence A051868 (16-gonal (or hexadecagonal) numbers: a(n) = n*(7*n-6))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  36. ^ Sloane, N. J. A. (ed.). "Sequence A036469 (Partial sums of A000009 (partitions into distinct parts))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  37. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A005384 (Sophie Germain primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  38. ^ a b Sloane, N. J. A. (ed.). "Sequence A080076 (Proth primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  39. ^ Sloane, N. J. A. (ed.). "Sequence A074501 (a(n) = 1^n 2^n 5^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-31.
  40. ^ "Sloane's A001608 : Perrin sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  41. ^ Sloane, N. J. A. (ed.). "Sequence A001567 (Fermat pseudoprimes to base 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  42. ^ Sloane, N. J. A. (ed.). "Sequence A002464 (Hertzsprung's problem: ways to arrange n non-attacking kings on an n X n board, with 1 in each row and column. Also number of permutations of length n without rising or falling successions)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  43. ^ Sloane, N. J. A. (ed.). "Sequence A057468 (Numbers k such that 3^k - 2^k is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  44. ^ Sloane, N. J. A. (ed.). "Sequence A001105 (a(n) = 2*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  45. ^ Sloane, N. J. A. (ed.). "Sequence A071395 (Primitive abundant numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  46. ^ Sloane, N. J. A. (ed.). "Sequence A000330 (Square pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  47. ^ Sloane, N. J. A. (ed.). "Sequence A000326 (Pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  48. ^ Sloane, N. J. A. (ed.). "Sequence A001106 (9-gonal (or enneagonal or nonagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  49. ^ Sloane, N. J. A. (ed.). "Sequence A014206 (a(n) = n^2 n 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  50. ^ Sloane, N. J. A. (ed.). "Sequence A160160 (Toothpick sequence in the three-dimensional grid)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  51. ^ Sloane, N. J. A. (ed.). "Sequence A002379 (a(n) = floor(3^n / 2^n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  52. ^ Sloane, N. J. A. (ed.). "Sequence A027480 (a(n) = n*(n 1)*(n 2)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  53. ^ Sloane, N. J. A. (ed.). "Sequence A005282 (Mian-Chowla sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  54. ^ Sloane, N. J. A. (ed.). "Sequence A108917 (Number of knapsack partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  55. ^ "A000217 - OEIS". oeis.org. Retrieved 2024-11-29.
  56. ^ Sloane, N. J. A. (ed.). "Sequence A005900 (Octahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  57. ^ Sloane, N. J. A. (ed.). "Sequence A001599 (Harmonic or Ore numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  58. ^ Sloane, N. J. A. (ed.). "Sequence A316983 (Number of non-isomorphic self-dual multiset partitions of weight n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  59. ^ Sloane, N. J. A. (ed.). "Sequence A005899 (Number of points on surface of octahedron with side n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-31.
  60. ^ Sloane, N. J. A. (ed.). "Sequence A003001 (Smallest number of multiplicative persistence n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-31.
  61. ^ Sloane, N. J. A. (ed.). "Sequence A000292 (Tetrahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  62. ^ Sloane, N. J. A. (ed.). "Sequence A000975 (Lichtenberg sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-31.
  63. ^ Sloane, N. J. A. (ed.). "Sequence A000979 (Wagstaff primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  64. ^ Sloane, N. J. A. (ed.). "Sequence A000070 (a(n) = Sum_{k=0..n} p(k) where p(k) = number of partitions of k (A000041))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-31.
  65. ^ Sloane, N. J. A. (ed.). "Sequence A001844 (Centered square numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  66. ^ Sloane, N. J. A. (ed.). "Sequence A050535 (Number of multigraphs on infinite set of nodes with n edges)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-31.
  67. ^ a b Sloane, N. J. A. (ed.). "Sequence A033553 (3-Knödel numbers or D-numbers: numbers n > 3 such that n divides k^(n-2)-k for all k with gcd(k, n) = 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-31.
  68. ^ Sloane, N. J. A. (ed.). "Sequence A030984 (2-automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2021-09-01.
  69. ^ Sloane, N. J. A. (ed.). "Sequence A000787 (Strobogrammatic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  70. ^ Sloane, N. J. A. (ed.). "Sequence A000123 (Number of binary partitions: number of partitions of 2n into powers of 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-31.
  71. ^ Sloane, N. J. A. (ed.). "Sequence A048633 (Triangular matchstick numbers: a(n) = 3*n*(n 1)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-31.
  72. ^ Sloane, N. J. A. (ed.). "Sequence A049363 (a(1) = 1; for n > 1, smallest digitally balanced number in base n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  73. ^ Sloane, N. J. A. (ed.). "Sequence A076185 (Numbers n such that n!! 2 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-31.
  74. ^ Sloane, N. J. A. (ed.). "Sequence A006851 (Trails of length n on honeycomb lattice)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-18.
  75. ^ "Colorado is a rectangle? Think again". 23 January 2023.
  76. ^ Sloane, N. J. A. (ed.). "Sequence A045636 (Numbers of the form p^2 q^2, with p and q primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.