Lets start with n = 1422960
we start checking the divisibility of the number n with the prime numbers. We start with the smallest prime number 2 and then move to higher prime numbers sequentially i.e.3,5,7,11,13,17 etc.
Divisibility rule by 2 - If the number is even, it is divisible by 2.
After division by 2
n = 2 * 711480
Again after division by 2
n = 2*2*355740
Again after division by 2
n = 2*2*2*177870
Again after division by 2
n = 2*2*2*2*88935
Now, 88935 is not divisible by 2 as it is odd. Now, we need to check the divisibility by 3 i.e. the next prime number. But before checking that, we see that the number is clearly divisible by 5 because the last digit of 88935 is 5. Hence, we first divide 88935 by 5.
After division by 5n = 2*2*2*2*5*17787
Now, 17787 is not further divisible by 5. Now, we will check the divisibility by 3 as we left it earlier.
Divisibility Rule by 3 = Sum of the digits of the number is divisible by 3.
After division by 3,
n = 2*2*2*2*5*3*5929
Now, 5929 is not further divisible by 3 as the sum of digits of 5929 (5+9+2+9 = 25) is not divisible by 3. Hence, we check the divisibility by the next higher prime number i.e. 7
Divisibility Rule by 7 = Form an alternating combinations of 3 digits from right to left and the subtract the sum of even combinations from sum of odd combinations. If the result is divisible by 7, the original number is divisible by 7.
Ex- lets check the divisibility of
1369851 by 7. After forming an alternating combinations of 3 digits from right to left, we get 1,369,851. Now, subtracting the sum of even combinations from sum of odd combinations, we get 851 + 1 - 369 = 483. Since, 483 is divisible by 7, the original number is divisible by 7.Now, take the number 5,929To check its divisibility by 7, we take 929-5 = 924, which is divisible by 7.After division by 7,
n = 2*2*2*2*5*3*7*847Again after division by 7,
n = 2*2*2*2*5*3*7*7*121Now, we check the divisibility of n by next higher prime number i.e. 11 (we have already checked divisibility by 2,3 and 7). Clearly 121 is divisible by 11.n = 2*2*2*2*5*3*7*7*11*11Further, you can learn the divisibility rule for division by 11 and 13. You do not need to go further than that in most cases.Dbrunik
i simply cannot wrap my head around how to prime factorize these quickly, without a calculator.