cyberangles blog

Checking if a Large Number is Divisible by 6

Divisibility rules are useful mathematical shortcuts that help us determine if one number can be evenly divided by another without performing the actual division. In this blog, we'll focus on the rule to check if a large number is divisible by 6. A number is divisible by 6 if it is divisible by both 2 and 3. Let's explore this in detail.

2026-07

Table of Contents#

  1. Divisibility Rule for 2
  2. Divisibility Rule for 3
  3. Combining the Rules for 6
  4. Example Usage
  5. Best Practices
  6. Common Pitfalls
  7. References

Divisibility Rule for 2#

A number is divisible by 2 if its last digit is even. That is, the last digit is 0, 2, 4, 6, or 8. For example, consider the number 124. The last digit is 4, which is even. So, 124 is divisible by 2.

Divisibility Rule for 3#

A number is divisible by 3 if the sum of its digits is divisible by 3. Let's take the number 135. The sum of its digits is (1 + 3+ 5=9). Since 9 is divisible by 3, 135 is divisible by 3.

Combining the Rules for 6#

As mentioned earlier, for a number to be divisible by 6, it must satisfy both the divisibility rules of 2 and 3. So, first, check if the last digit is even (for divisibility by 2). Then, calculate the sum of all the digits and check if that sum is divisible by 3.

Example Usage#

Let's take a large number, say 123456.

  • Check for divisibility by 2: The last digit is 6, which is even. So, it passes the first test.
  • Check for divisibility by 3: The sum of the digits is (1+2 + 3+4+5+6 = 21). Since (21\div3 = 7) (no remainder), 21 is divisible by 3. Since the number 123456 passes both tests, it is divisible by 6.

Another example: 9876543210

  • Divisibility by 2: Last digit is 0 (even). Passes.
  • Divisibility by 3: Sum of digits (9 + 8+7+6+5+4+3+2+1+0=45). (45\div3 = 15). Passes. So, 9876543210 is divisible by 6.

Best Practices#

  • Break down the number: For very large numbers, it can be helpful to break the number into smaller parts (e.g., groups of digits) while calculating the sum for the divisibility by 3 rule. This can make the calculation more manageable.
  • Use modular arithmetic (optional for advanced users): In programming, if you are dealing with very large numbers (beyond the standard data types), you can use modular arithmetic. For example, in Python, you can take each digit as a character in a string, convert it to an integer, and then use the modulus operator (%) to check divisibility.

Here is a simple Python code snippet:

num_str = "123456"
# Check divisibility by 2
if int(num_str[-1]) % 2 == 0:
    # Check divisibility by 3
    sum_digits = sum(int(digit) for digit in num_str)
    if sum_digits % 3 == 0:
        print(f"{num_str} is divisible by 6")
    else:
        print(f"{num_str} is not divisible by 6")
else:
    print(f"{num_str} is not divisible by 6")

Common Pitfalls#

  • Forgetting to check both rules: It's easy to only check one of the rules (either 2 or 3). Always remember that both conditions must be met.
  • Miscalculating the sum of digits: When adding up the digits of a large number, it's possible to make an arithmetic error. Double - check your addition, especially for very large numbers.

References#