Multiplying Any Number by 111: The Shift-and-Add Trick

Multiplying any number by 111 takes the same time as three column additions, because 111 = 100 + 10 + 1.

That identity is the entire trick. Stack three shifted copies of the number, sum each column, carry where needed. No memorised formula required.

Why the Trick Works

The algebraic identity: n × 111 = n × 100 + n × 10 + n × 1

Written as a long-addition column for n = 786:

    786
   7860
  78600

Add column by column, right to left. Each digit in the result is the sum of the digits from the three shifted copies that land in the same column.

For a 3-digit input ABC (A = hundreds digit, B = tens digit, C = units digit), the columns sum to:

Position	Raw digit sum
Ten-thousands	A
Thousands	A + B
Hundreds	A + B + C
Tens	B + C
Units	C

When any raw sum reaches 10 or above, write the units digit of that sum and carry the tens digit one position to the left. Work strictly right to left, because a carry from one position can trigger another carry in the next.

The key insight is that 111 has three non-zero digits, so each column in the result accumulates contributions from three copies of the input. Multiplying by 11 uses two copies (window of 2); multiplying by 1111 would use four (window of 4). The width of the multiplier determines the width of the summation window.

Two-Digit Numbers

For a 2-digit number AB, the same column addition gives four positions: A, (A+B), (A+B), B. The middle two positions are equal because both shifted copies of the tens digit and the units digit overlap in the same columns.

No-carry examples:

• 23 × 111: positions = 2, (2+3), (2+3), 3 = 2, 5, 5, 3. Answer: 2,553. Verify: 2,300 + 230 + 23 = 2,553.
• 45 × 111: positions = 4, (4+5), (4+5), 5 = 4, 9, 9, 5. Answer: 4,995. Verify: 4,500 + 450 + 45 = 4,995.

Both have digit sums below 10, so no carry is needed.

Carry example:

• 78 × 111: A = 7, B = 8, raw positions = 7, 15, 15, 8.
  • Units: 8 — write 8, carry 0
  • Tens: 15 + 0 = 15 — write 5, carry 1
  • Hundreds: 15 + 1 = 16 — write 6, carry 1
  • Thousands: 7 + 1 = 8 — write 8, carry 0
  • Answer: 8,658. Verify: 7,800 + 780 + 78 = 8,658.

Three-Digit Numbers

No-Carry Case: 312 × 111

• A = 3, B = 1, C = 2
• Raw positions: 3, (3+1), (3+1+2), (1+2), 2 = 3, 4, 6, 3, 2
• No position reaches 10
• Answer: 34,632. Verify: 31,200 + 3,120 + 312 = 34,632.

Carry Case: 456 × 111

• A = 4, B = 5, C = 6
• Raw positions: 4, (4+5), (4+5+6), (5+6), 6 = 4, 9, 15, 11, 6
• Carry right to left:
  • Units: 6 — write 6, carry 0
  • Tens: 11 + 0 = 11 — write 1, carry 1
  • Hundreds: 15 + 1 = 16 — write 6, carry 1
  • Thousands: 9 + 1 = 10 — write 0, carry 1
  • Ten-thousands: 4 + 1 = 5 — write 5, carry 0
• Answer: 50,616. Verify: 45,600 + 4,560 + 456 = 50,616.

Notice the chain: the carry from the tens position (11) flows into hundreds (15+1=16), which generates a second carry into thousands (9+1=10), which generates a third carry into ten-thousands. Skip any link in that chain and the answer is wrong.

The Heavy-Carry Case: 786 × 111

Three consecutive high digits (7, 8, 6) produce three cascading carries. This is the example most guides skip or oversimplify.

• A = 7, B = 8, C = 6
• Raw positions: 7, (7+8), (7+8+6), (8+6), 6 = 7, 15, 21, 14, 6
• Carry right to left:
  • Units: 6 — write 6, carry 0
  • Tens: 14 + 0 = 14 — write 4, carry 1
  • Hundreds: 21 + 1 = 22 — write 2, carry 2
  • Thousands: 15 + 2 = 17 — write 7, carry 1
  • Ten-thousands: 7 + 1 = 8 — write 8, carry 0
• Answer: 87,246. Verify: 78,600 + 7,860 + 786 = 87,246.

The hundreds position (21 + carry 1 = 22) generates a carry of 2, not the usual 1. Students who assume every carry equals 1 will arrive at wrong intermediate digits. Work the position arithmetic fully before writing down the carry value.

Four-Digit Numbers and a Common Error

For a 4-digit number ABCD, the sliding window of 3 extends to six result positions:

Position	Raw digit sum
Hundred-thousands	A
Ten-thousands	A + B
Thousands	A + B + C
Hundreds	B + C + D
Tens	C + D
Units	D

For 1234 (A=1, B=2, C=3, D=4):

• Raw positions: 1, (1+2), (1+2+3), (2+3+4), (3+4), 4 = 1, 3, 6, 9, 7, 4

• No position reaches 10

• Answer: 136,974. Verify: 123,400 + 12,340 + 1,234 = 136,974.

• Note: many guides give 137,574 instead of 136,974. That error comes from applying the ×11 adjacent-pair pattern (window of 2) to a ×111 problem (window of 3). The wrong window produces only five positions for a four-digit input, missing the B+C+D triple entirely.

Practice Problems

Work each from the column-table method. Check the carry chain before committing to an answer.

• 52 × 111: Raw = 5, (5+2), (5+2), 2 = 5, 7, 7, 2. No carry. Answer: 5,772.
• 78 × 111: Raw = 7, 15, 15, 8. Carries: units 8 stays; tens 15 gives 5 carry 1; hundreds 15+1=16 gives 6 carry 1; thousands 7+1=8. Answer: 8,658.
• 214 × 111: Raw = 2, (2+1), (2+1+4), (1+4), 4 = 2, 3, 7, 5, 4. No carry. Answer: 23,754.
• 635 × 111: Raw = 6, (6+3), (6+3+5), (3+5), 5 = 6, 9, 14, 8, 5. Carries: 5 stays; 8 stays; 14 gives 4 carry 1; 9+1=10 gives 0 carry 1; 6+1=7. Answer: 70,485.

The discipline of applying a rule exactly, including every edge case, is what placement aptitude sections reward. FACE Prep’s guide to coding-and-decoding problem types covers the same kind of systematic pattern-following in verbal reasoning rounds. For another example of translating a real-world formula into reliable addition steps, see how broadcasters calculate cricket six distances.

Speed-multiplication techniques like this one appear in the quantitative aptitude sections of TCS NQT and AMCAT. Both tests include 25 to 35 quantitative questions in a 40 to 60-minute window, where shaving 10 seconds per problem adds roughly 5 minutes of buffer for the harder questions.

The carry-chain walkthrough in 786 × 111 is an exercise in systematic rule-following: apply the pattern, propagate every overflow, skip nothing. TinkerLLM applies that same discipline to large language model experiments. You test what actually changes model behaviour rather than just reading about it. Entry is ₹299.