Editing Factorization (section)

===Example===
For factoring {{math|1=''n'' = 1386}} into primes:
* Start with division by 2: the number is even, and {{math|1=''n'' = 2 · 693}}. Continue with 693, and 2 as a first divisor candidate. 
* 693 is odd (2 is not a divisor), but is a multiple of 3: one has {{math|1= 693 = 3 · 231}} and {{math|1=''n'' = 2 · 3 · 231}}. Continue with 231, and 3 as a first divisor candidate.
* 231 is also a multiple of 3: one has {{math|1= 231 = 3 · 77}}, and thus {{math|1=''n'' = 2 · 3<sup>2</sup> · 77}}. Continue with 77, and 3 as a first divisor candidate.
* 77 is not a multiple of 3, since the sum of its digits is 14, not a multiple of 3. It is also not a multiple of 5 because its last digit is 7. The next odd divisor to be tested is 7. One has {{math|1= 77 = 7 · 11}}, and thus {{math|1=''n'' = 2 · 3<sup>2</sup> · 7 · 11}}. This shows that 7 is prime (easy to test directly). Continue with 11, and 7 as a first divisor candidate. 
* As {{math|7<sup>2</sup> > 11}}, one has finished. Thus 11 is prime, and the prime factorization is 
: {{math|1=1386 = 2 · 3<sup>2</sup> · 7 · 11}}.