Number Properties for the GMAT: Divisibility, Primes and Parity
Management Exams2 min readNov 21, 2026

Number Properties for the GMAT: Divisibility, Primes and Parity

Number Properties for the GMAT: Divisibility, Primes and Parity
2 min read · 357 words

Quick Answer

Master GMAT Number Properties: Divisibility, Primes and Parity

Number properties are the hidden curriculum of GMAT Quant: divisibility, primes, even-odd parity, remainders and consecutive-integer behaviour. Master the rules and half the “hard” questions become one-step deductions.

Visual Summary

  • Primes to 50 — memorise: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47.
  • Divisibility — by 3: digit sum; by 4: last two digits; by 8: last three.
  • Even × odd rules — even times anything is even.
  • Remainders cycle — powers repeat their units digits.

Divisibility and Primes

Divisibility shortcuts: by 2 (last digit even), 3 (digit sum divisible by 3), 4 (last two digits divisible by 4), 5 (ends 0/5), 6 (by both 2 and 3), 8 (last three digits), 9 (digit sum by 9), 11 (alternating digit-sum difference). A number divisible by both 3 and 4 is divisible by 12 — the LCM — because 3 and 4 share no factor; with shared factors (6 and 8), the guarantee is LCM 24, not the product 48.

Prime factorisation answers factor-count questions: N = 2ᵃ × 3ˡ has (a+1)(b+1) factors. The primes under 50 should be instant recall; 1 is NOT prime; 2 is the only even prime.

Parity and Consecutive Integers

Even ± even = even; odd ± odd = even; even ± odd = odd; even × anything = even; odd × odd = odd. Consecutive integers: among any two consecutive, exactly one is even; among any three, exactly one is divisible by 3 — so the product of three consecutive integers is always divisible by 6. Sum of two consecutive integers is always odd.

Remainders and Units Digits

Units digits of powers cycle: 2-powers run 2, 4, 8, 6; 3-powers run 3, 9, 7, 1; 7-powers run 7, 9, 3, 1. For 7⁴⁷, divide the exponent by the cycle length: 47 mod 4 = 3, so the units digit is the third in 7’s cycle — 3. Remainder arithmetic: (a + b) mod n = ((a mod n) + (b mod n)) mod n — add remainders, re-reduce.

Exam Angle

Practise these deductions under the clock in the GMAT mock — number-property questions reward instant rule recall.

FAQ

Is 1 a prime?
No — primes need exactly two factors; 1 has one.

How do units-digit cycles work?
Divide the exponent by the cycle length; the remainder picks the digit.

Related reading

Quick revision

  • Primes to 50: — memorise: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47.
  • Divisibility: — by 3: digit sum; by 4: last two digits; by 8: last three.
  • Even × odd rules: — even times anything is even.
  • Remainders cycle: — powers repeat their units digits.
  • SI Units and Measurement: The 7 Base Units and Common Prefix Mistakes in NEET & JEE Physics
ShareTelegramX

Have a doubt on this topic?