We show that the polyhedron defined as the convex hull of the lattice points above the hyperbola $\left\{xy = n\right\}$ has between $Ω(n^{1/3})$ and $O(n^{1/3} \log n)$ vertices. The same bounds apply to any hyperbola with rational slopes except that instead of $n$ we have $n/Δ$ in the lower bound and by $\max\left\{Δ, n/Δ\right\}$ in the upper bound, where $Δ\in \mathbb{Z}_{>0}$ is the discriminant. We also give an algorithm that enumerates the vertices of these convex hulls in logarithmic time per vertex. One motivation for such an algorithm is the deterministic factorization of integers.