Prime factorization in Clojure

hello.clj

(ns hello)

(defn is-divisible-by
  [number divisor]
  (= (rem number divisor) 0))

(defn factor-by
  [number factor acc]
  (loop [n number acc1 acc]
    (if (is-divisible-by n factor)
      (recur (quot n factor) (conj acc1 factor))
      [n acc1]
      )
    ))

(defn prime-factors
  [number]

  (loop [n number acc [] factor 2]
    (if (= n 1)
      acc
      (let [[n acc] (factor-by n factor acc)]
        (recur n acc (+ 1 factor)))))

  )


(print (prime-factors 200277))