Problem

Source:

Tags:



The integer $n$ has exactly six positive divisors, and they are: $1<a<b<c<d<n$. Let $k=a-1$. If the $k$-th divisor (according to above ordering) of $n$ is equal to $(1+a+b)b$, find the highest possible value of $n$.