Factorization in Haskell

Factors.hs

import Data.Numbers.Primes
import Data.List

factors :: Integral n => n -> [n]
factors n = case find (\p -> n `mod` p == 0) candidates of
        Just p -> p : (factors $ n `div` p)
        Nothing -> [n]
    where candidates = takeWhile (<= ceiling (sqrt (fromIntegral n))) primes