Divisor 15391
- Prime Number:
- Yes!
- Divisibility test:
- The "Michael Ehling Test"
- Test Discovered by:
- Matt Parker
- Date:
- 11/11/2024
The "Michael Ehling Test" for Divisibility by 15391
To determine if any number is divisible by 15391, apply the "Michael Ehling Test":
- If your number ("X") has 7 digits or more, separate the last (smallest) 6 digits from the rest. This makes two smaller numbers, call them Left and Right (note: don't add in trailing zeros to L). If there are fewer than 7 digits, L = 0 and therefore R = X.
- Multiply L by 415 and subtract this from R.
- Take that result and cross off its final digit (units). Take this new number and subtract 1539 times the digit you just crossed off. Call this final result "Y".
- Y will be much smaller than X, but we have preserved divisibility by 15391. That is, your original number is divisible by 15391 if (and only if) Y is. Now that it's much smaller, with basic knowledge of your 15391-times tables, it should be easy to visually see if Y is divisible by 15391. If the Y is still much larger than 15391, the above process can be repeated until it does reduce to within small multiples of 15391.
Easy!