Integer divisors of an integer Determine all positive integers $N$ to which the following applies (i) $N$ has more than three different positive integer divisors 
and (ii) for all divisors $p,q$ of $N$ with $1 < p < q < N$, also $q-p$ is a divisor of $N$. 
$N$ will have 2 as a divisor. Because if $N$ only had odd divisors the difference q-p would be even and it cannot divide $N$ as $N$ only has odd divisors. Contradiction - 2 must be a divisor. 

Let $n\in\mathbb{N}$ such that
(i) $n$ has at least four different divisors (i.e at least two different divisors apart from $1$ and $n$)
(ii) for all divisors $p,q$ of $n$ with $1<p<q<n$, $q-p$ is also a divisor of $n$.
Claim 1: $2$ divides $n$.
Assume to the contrary that $2$ does not divide $n$. Let $p,q$ be divisors of $n$ such that $1<p<q<n$ (they exist by (i)). Then $p$ and $q$ are odd, so $q-p$ is even and a divisor of $n$ by (ii), so $n$ is even which is a contradiction. Thus $2$ divides $n$.
Claim 2: If $n$ is not a power of $2$, then $3$ divides $n$.
Assume to the contrary that $3$ does not divide $n$. Let $p$ be a prime divisor of $n$. Then $p\geq5$. By (ii) and induction, $p-2k$ is a divisor of $n$ for all $k\in\{1,\ldots,(p-1)/2\}$ ($p$ and $2$ are divisors, so $p-2$ is, so $p-4$ is, so $\ldots$). So $p-2((p-1)/2-1)=3$ is a divisor of $n$ which is a contradictions. This $3$ divides $n$.
Claim 3: $n$ cannot have any prime divisors apart from $2$ and $3$.
Assume to the contrary that $n$ has a prime divisor that is not $2$ or $3$. Let $p_1,\ldots,p_\ell$ be all distinct prime divisors of $n$ that are not $2$ or $3$. Then $p:=2p_1\cdots p_\ell$ is a divisor of $n$ and so is $2p-3$ by (ii). Neither $2$, nor $3$, nor any of the $p_i$ divides $2p-3$, so $2p-3$ has a prime divisor that is not in the set $\{2,3,p_1,\ldots,p_\ell\}$ which is a contradiction. Thus $n$ cannot have any prime divisors apart from $2$ and $3$.
So now you know that $n$ is of the form $2^u3^v$. I'll leave it to you to show that $6,8,12$ are the only options.
