📐

Divisibility Calculator

Math Free Instant Private
Math

### Number Theory & Classical Divisibility Rules An integer $a$ is divisible by a non-zero integer $b$ (written $b \mid a$) if there exists an integer $q$ such that $a = b \cdot q$, leaving a.

Reviewed by Miss Saima · MA Mathematics
Last updated:
Editorial Guidelines

⚙ Input Values

📊 Results

Divisibility Outcome
YES: 1260 is EXACTLY DIVISIBLE by 12 (Remainder = 0)
Integer Quotient (q)
105
Remainder (r = A mod B)
0
Euclidean Division Identity
1260 = (12 × 105) + 0
Divisibility by 2 through 13 Check
Divisible by: [2, 3, 4, 5, 6, 7, 9, 10, 12] out of {2,3,4,5,6,7,8,9,10,11,12,13}
✦ Number Theory Diagnostic Summary
Number Theory Divisibility Profile (1,260 ÷ 12): YES: 1260 is EXACTLY DIVISIBLE by 12 (Remainder = 0). Quotient q = 105, Remainder r = 0. Euclidean Division Identity: 1260 = (12 × 105) + 0. Multi-Divisor Scan: Divisible by: [2, 3, 4, 5, 6, 7, 9, 10, 12] out of {2,3,4,5,6,7,8,9,10,11,12,13}. Euclidean Theorem: For integers $a$ and $b \ne 0$, there exist unique integers $q$ and $r$ such that $a = bq + r$ with $0 \le r < |b|$; divisibility $b \mid a$ holds if and only if remainder $r = 0$.
Embed on Your Website

Copy and paste this code into your website.

<iframe src="https://calcusolve.com/calculator/divisibility-calculator?embed=true" width="100%" height="600" frameborder="0" loading="lazy" title="Divisibility Calculator"></iframe>

📐 Formula

Formula Reference: Divisibility Calculator
Input variables:
dividendNumber — Dividend Number (A)
divisorNumber — Divisor Number (B)
Computed outputs:
isDivisibleStatus — Divisibility Outcome
integerQuotientValue — Integer Quotient (q)
euclideanRemainderValue — Remainder (r = A mod B)
euclideanIdentityEquation — Euclidean Division Identity
commonDivisorsMatrix — Divisibility by 2 through 13 Check
Mathematical relationships extracted from calculation logic:
q = Math.floor(a / b)
r = ((a % b) + Math.abs(b)) % Math.abs(b)
Standard: NIST / ISO mathematical definitions

💡 Practical Example

✅

Testing whether 1,001 is divisible by 7 yields an exact quotient of 143 with remainder 0, proving that $1,001 = 7 \times 11 \times 13$.

📖 About Divisibility Calculator

Number Theory & Classical Divisibility Rules

An integer a is divisible by a non-zero integer b (written b a) if there exists an integer q such that a = b · q, leaving a remainder r = 0:

  • **
  • Euclidean Division Theorem**:

a = b · q + r (0 r < |b|)

  • **
  • The Universal Divisibility Rules**:
  • Divisible by 2: Last digit is even (0, 2, 4, 6, 8).
  • Divisible by 3: Sum of all digits is a multiple of

3.

  • Divisible by 4: Last two digits form a number divisible by

4.

  • Divisible by 5: Last digit is 0 or

5.

  • Divisible by 6: Number satisfies rules for both 2 and

3.

  • Divisible by 7: Truncate last digit, double it, and subtract from remaining number; result must be divisible by

7.

  • Divisible by 8: Last three digits form a number divisible by

8.

  • Divisible by 9: Sum of all digits is divisible by

9.

  • Divisible by 10: Last digit is

0.

  • Divisible by 11: Alternating sum of digits is divisible by

11.

  • Divisible by 12: Number is divisible by both 3 and

4.

How to Use This Calculator

Enter your Dividend Number (A) (e.g. 1260), Divisor Number (B) (e.g. 12), and Arithmetic Case Benchmark — choose from Custom Division Pair, 1,260 ÷ 12 (Exact Quotient: 105 / Remainder 0), 1,024 ÷ 8 (Exact Quotient: 128 / Remainder 0). Results update instantly as you type — adjust any value to compare scenarios.

The Formula

Formula Reference: Divisibility Calculator

Input variables:

dividendNumber — Dividend Number (A)

divisorNumber — Divisor Number (B)

Computed outputs:

isDivisibleStatus — Divisibility Outcome

integerQuotientValue — Integer Quotient (q)

euclideanRemainderValue — Remainder (r = A mod B)

euclideanIdentityEquation — Euclidean Division Identity

commonDivisorsMatrix — Divisibility by 2 through 13 Check

Mathematical relationships extracted from calculation logic:

q = Math.floor(a / b)

r = ((a % b) + Math.abs(b)) % Math.abs(b)

Standard: NIST / ISO mathematical definitions

Worked Example

Testing whether 1,001 is divisible by 7 yields an exact quotient of 143 with remainder 0, proving that 1,001 = 7 × 11 ×

13.

Understanding Your Result

Evaluate your result in the context of your specific use case and relevant industry standards or reference values. A single calculated result is a starting point — test two to three scenarios to understand how sensitive the outcome is to your key input assumptions. For high-stakes decisions, verify your result against a secondary source or subject-matter expert before acting.

💡 Mathematical Rigor & Applied Context

  • This calculator applies exact mathematical definitions following conventions established by NIST and international standards bodies.
  • Rounding errors accumulate across multi-step calculations. For precision-critical work, maintain extra significant figures through all intermediate steps.
  • Many mathematical concepts have multiple valid formulations — if a result seems unexpected, verify which convention or definition applies to your context.
  • Dimensional analysis (unit tracking) is the fastest way to catch formula errors. Every term in an equation must have consistent, compatible units.
  • Numerical methods used in digital calculators introduce floating-point precision limits (~15 significant digits for IEEE 754 double precision).
  • For statistical and probabilistic calculations, always specify whether you are working with population parameters or sample statistics — formulas differ.
  • Visualizing a problem geometrically or testing with known boundary values (zero, infinity, negative) reveals hidden errors faster than algebraic checking.
  • When in doubt, validate your result against a simplified hand calculation or a published worked example from a textbook or standards document.

Results are for informational and educational purposes only. Always verify critical decisions with a qualified professional.

❓ Frequently Asked Questions

What does it mean for one number to be divisible by another?

A number A is divisible by B if dividing A by B results in an exact integer with a remainder of zero.

What is the divisibility rule for 7?

Take the last digit of the number, double it, and subtract it from the remaining truncated number. If the resulting difference is divisible by 7 (or 0), the original number is divisible by 7.

What is the divisibility rule for 11?

Subtract and add digits in an alternating pattern from right to left. If the final sum is 0 or a multiple of 11, the number is divisible by 11.

Is zero divisible by every number?

Yes. Zero divided by any non-zero integer B equals 0 with remainder 0. However, division by zero is undefined.

How do you test divisibility by composite numbers like 12?

Break the composite divisor into coprime factors (for 12, use 3 and 4). A number is divisible by 12 if and only if it is divisible by both 3 (digit sum) and 4 (last 2 digits).

Try Other Calculators