This article arose out of a first year undergraduate class project concerned with divisors. The class was presented with a sheet containing the prime factorisations and a list of divisors for the natural numbers up to 120. Among the many observations and conjectures which the students formulated some were related to the standard result about the number of divisors in terms of the prime factorisation. One conjecture made by several students which was not in the textbooks was d(n!) = 2n-1 where d(k) denotes the number of positive divisors of k. The result is true for n = 2, 3, 4, 5, which takes one to the limit of the data sheet given to the students (5! = 120). Unfortunately it breaks down for n = 6, since d(5!) = 16 but d (6!) = 30 and not 32. Several students reported that they had reached their conjecture on the basis that they thought the number of divisors of n! would double every time n increased by 1.