I've seen a question in a math exam, asking to find the prime decomposition of 2014. It's 2*19*53.
I found it odd and a little fastidious at first to try to find the multiples of 1007, trying to divide 1007 by 3, then 7, then 11, then 13, then 17, then 19.
Any way to quickly eliminate possible multiples ?
I've got a weird technique to check if a number that doesn't immediately look like a non-prime really is a prime or not.
For example, 143 is ambiguous. if I substract 13 to it, I have 130+13, which immediately shows it's a multiple of 13.
But for 221, which is 13*17, my technique becomes useless.
I've also seen the technique where you add up each digit, but I don't understand why this method works.
Don't you know any technique to either quickly find multiples, or know if the number is a prime ? Or should I just start remembering them individually ? Would it work for number less than 3000 ? Those numbers are not so big...
Here are two tricks that, especially used in combination, can check if the positive integer $n$ is divisible by the positive integer $d$.
(1) $n$ is divisible by $d$ if and only if $n+kd$ is divisible by $d$ (this holds for any integer $k$. Thus you can add or subtract multiples of $d$ from $n$ without affecting divisibility by $d$.
(2) If $n=bc$ and $c$ is relatively prime to $d$, then $n$ is divisible by $d$ if and only if $b$ is divisible by $d$. (That is you can cancel a factor from $n$ provided that factor is relatively prime to $d$.)
Let's see how this can be applied to your problem of factoring $2014$.
First we take out the obvious factor of $2$, leaving us with $1007$ to factor.
Since the sum of digits is not divisible by $3$, $1007$ is not divisible by $3$.
Also $1007$ is obviously not divisible by $5$.
Next, using (1), $1007$ is divisible by $7$ iff $1007-7=1000$ is divisible by $7$, which it is not.
Next, $1007$ is divisible by $11$ iff $1007+33=1040$ is divisible by $11$, and $1040$ is divisible by $11$ iff $104$ is divisible by $11$ (using (2)), which it is not.
Next $1007$ is divisible by $13$ iff $1020$ is divisible by $13$ iff $102$ is divisible by $13$, which it is not.
Next $1007$ is divisible by $17$ iff $1007-17=990$ is divisible by $17$ iff $99$ is divisible by $17$, which it is not.
Next $1007$ is divisible by $19$ iff $1007-19\cdot 3=950$ is divisible by $19$ iff $95$ is divisible by $19$, which it is.
We've found a factor of $1007$, namely $19$. In fact, $1007=19\cdot 53$.
Note: This method looks long when written out, but with practice, it does allow for mental determination of divisibility by small numbers quite quickly and efficiently.