GMAT number properties: the concepts that repeat on Quant.

Number properties is the most efficient topic to study on GMAT Focus Quant. The concepts are finite, they recur across the section, and they reward pattern recognition over calculation. There is no on-screen calculator on Quant and no formula sheet on test day, so the leverage comes from knowing a handful of behaviors cold. This guide walks the high-frequency ones in order, each with a rule and a single worked line so you can see the mechanics fire.

Number properties rewards seeing structure, not grinding arithmetic. The student who recognizes that a question is really about prime factors finishes in twenty seconds; the one who starts multiplying burns two minutes and still misses it.

Integers and the vocabulary trap

An integeris a whole number — positive, negative, or zero — with no fractional part. Non-integers include fractions and decimals. Most number- properties questions live entirely in the integers, and the first trap is vocabulary, not math.

Three phrases describe the same relationship from different directions. If 12 and 3 are the two numbers in play, then 12 is divisible by 3, 3 is a factor of 12, and 12 is a multiple of3. All three are the single fact that 12 = 3 × 4 with no remainder. The exam switches between these phrasings on purpose; treat them as one idea read from either end.

Illustration:“Is n divisible by 6?” and “Is 6 a factor of n?” and “Is n a multiple of 6?” are the exact same question.

Two edge cases the exam loves to exploit. Every integer is a multiple of itself and a multiple of 1, and 1 is a factor of every integer. Zero is a multiple of every number (0 = d × 0), but you can never divide by zero, so 0 is never a factor of anything. When a question says “positive divisors” or “distinct factors,” read the qualifier carefully — whether 1 and the number itself count is exactly the kind of detail the answer choices are built to punish.

Prime factorization: the atomic view

A prime is an integer greater than 1 whose only factors are 1 and itself (2, 3, 5, 7, 11, and so on; 2 is the only even prime). Prime factorization breaks any integer into the unique product of primes that builds it. This is the single most useful move in the topic, because the prime factors are the atoms: divisibility, LCM, GCF, perfect squares, and the count of factors all read directly off the prime breakdown.

Illustration:360 = 2³ × 3² × 5. From that one line you can tell 360 is divisible by 8 (it has 2³), by 9 (it has 3²), and by 45 (3² × 5) — without dividing once.

The prime breakdown also counts factors for you. Take each exponent, add 1 to it, and multiply the results; that product is the total number of positive factors. The logic is that each factor is built by choosing how many copies of each prime to include, from zero up to its exponent.

Illustration:360 = 2³ × 3² × 5¹ has (3 + 1)(2 + 1)(1 + 1) = 4 × 3 × 2 = 24 positive factors. A related tell: a number is a perfect square exactly when every exponent in its prime factorization is even, which is why perfect squares always have an odd number of factors.

Divisibility rules

These let you test divisibility by inspection, which matters when there is no calculator. The high-yield ones:

Illustration:Is 5,148 divisible by 11? Alternate the digits: 5 − 1 + 4 − 8 = 0, and 0 is a multiple of 11, so yes. The digit sum is 18, divisible by 9, so it is also divisible by 9.

LCM and GCF through prime factors

Once you have prime factorizations, the least common multiple and greatest common factor fall out mechanically. Line up the prime factorizations and:

• GCF — take the lowest power of each prime the numbers share.
• LCM — take the highest power of every prime that appears in either number.

Illustration:24 = 2³ × 3 and 36 = 2² × 3². GCF takes the lows: 2² × 3 = 12. LCM takes the highs: 2³ × 3² = 72.

The intuitive reading of LCM is “when two repeating events next coincide.” If one bus comes every 24 minutes and another every 36 minutes and they leave together now, they next leave together in 72 minutes — the LCM.

One more relationship worth carrying: for any two positive integers, GCF × LCM equals their product. Check it on 24 and 36: 12 × 72 = 864, and 24 × 36 = 864. If a question hands you three of those four quantities, you can solve for the fourth without factoring at all.

Even and odd behavior

Even/odd questions are pure structure, no arithmetic. An even number has 2 as a factor; an odd number does not. The behavior under the two basic operations:

You do not need to memorize the table if you understand why. For multiplication, a product is even the moment anyfactor brings a 2 to the table, so even × anything is even, and a product is odd only when nofactor supplies a 2 — that is, odd × odd. For addition, two numbers of the same parity sum to even, and mixed parity sums to odd.

Illustration:If n is odd, then n² + n = n(n + 1) is the product of an odd and the next integer, which is even — one even factor is enough to settle it.

Positive, negative, and sign rules

Signs follow the same any/all logic. A product or quotient is negative when there is an odd count of negative factors and positive when there is an evencount (zero negatives counts as even). Even powers of any nonzero number are positive; odd powers keep the base's sign. Watch for zero, which is neither positive nor negative and breaks the “assume nonzero” habit on Data Sufficiency.

Illustration:(−2)⁴ = 16, but (−2)³ = −8 — even exponent erases the sign, odd exponent preserves it.

Units-digit cycles for powers

The units digit of a large power follows a short repeating cycle, so you can find the last digit of something enormous without computing it. Most digits cycle with a period that divides 4, which gives a clean method: divide the exponent by 4 and use the remainder to pick the position in the cycle (a remainder of 0 lands on the fourth, last entry). Some digits never change.

The steady digits (0, 1, 5, 6) keep the same units digit at every power, so they need no cycle. The digits 4 and 9 cycle with period 2 (4, 6 and 9, 1), which you can treat as the four-step rule too.

Illustration:What is the units digit of 7⁷⁹? Divide 79 by 4: remainder 3. The 3rd entry in 7's cycle (7, 9, 3, 1) is 3, so the units digit is 3.

Remainders

Every division of integers can be written as n = dk + r, where d is the divisor, k is the quotient, and r is the remainder with 0 ≤ r < d. The most useful way to read this is “n is a multiple of d, plus r.” That reframing turns abstract remainder questions into concrete number lists you can test.

Remainders also add and multiply, as long as you reduce back into range afterward. To find the remainder of a sum or product when divided by d, take the remainder of each piece, combine them, then take the remainder again.

Illustration:The remainder of 17 × 23 divided by 5: 17 leaves 2, 23 leaves 3, so 2 × 3 = 6, which leaves a remainder of 1. (Check: 391 = 78 × 5 + 1.)

The cycle method for big powers

Remainders of large powers cycle just like units digits. Compute the remainder of the first few powers, find where the pattern repeats, then map the exponent onto the cycle.

Illustration:Remainder of 3¹⁰⁰ divided by 4: powers of 3 leave remainders 3, 1, 3, 1… with period 2. Since 100 is even, it lands on the second entry, so the remainder is 1.

Consecutive integers and evenly-spaced sets

An evenly-spaced set is any sequence with a constant step: consecutive integers (step 1), consecutive even numbers (step 2), multiples of any number, arithmetic sequences in general. These have three properties worth memorizing because they collapse long sums into one multiplication.

• Mean equals median, and both equal (first + last) / 2. The set is symmetric, so the average sits at the midpoint.
• Sum = average × count. Find the midpoint, multiply by how many terms there are.
• Count = (last − first) / step + 1. The “+ 1” is the fence-post correction — count the posts, not the gaps between them.

Illustration:Sum of the even integers from 12 to 40. Count = (40 − 12) / 2 + 1 = 15 terms. Average = (12 + 40) / 2 = 26. Sum = 26 × 15 = 390 — no term-by-term addition.

How to drill this

Number properties pays off fastest because the rules are few and they stack. Build prime factorization into a reflex, since it underwrites divisibility, LCM, and GCF. Internalize the even/odd and sign logic so you reason about parity instead of plugging numbers. Memorize the four-digit units-digit cycles and the n = dk + r frame for remainders. Lock in the evenly-spaced formulas, especially the fence-post + 1, which is the single most common counting slip in the section. Then practice spotting which property a question is testing — recognition is where the time savings live.

The platform

Zakarian GMAT's Quant chapters teach each of these properties with worked reasoning and a graded problem set, and the error log's six-tag taxonomy separates a conceptual number-properties gap from a careless slip so you fix the right thing. The sample chapter is free if you want to see the teaching before you commit.