BREAKING: Target Test Prep releases Brand New 2026 On Demand GMAT prep course

Redeem

Target Test Prep · GMAT

Choose how you want to prepare

Learn live with an expert or move at your own pace. Every option includes the complete TTP study system.

★★★★★5.0559 reviews
Vote for Target Test Prep, Newsweek Readers’ Choice Awards 2026
NEWSWEEK READERS’ CHOICE 2026

BIG NEWS! Target Test Prep has been nominated, and they’d love your vote!

TTP has worked incredibly hard to build the best test prep experience possible, and winning Newsweek’s 2026 Readers’ Choice Award for Best Test Prep would mean a lot to them. If TTP has helped you, they’d be incredibly grateful for your vote. You can vote once each day through September 9.

Vote for TTP
GMATLiveTeach 7 seats left
Chris Peckover
NEXT LIVE COHORT

Oct 13 to Jan 7, 2027

with Chris Peckover

Schedule
Tue, Thu · 8:00 to 10:00 PM ET
Included
40 live hours + 6 months of GMAT OnDemand
  • Live instruction and real-time questions
  • Class recordings and assigned practice
View class & enroll
Limited cohort · enrollment openTarget Test Prep
EALiveTeach 5 seats left
Logan Thompson
EXECUTIVE ASSESSMENT

Sep 6 to Dec 6, 2026

with Logan Thompson

Schedule
Sun · 9:30 AM to 12:30 PM ET
Included
40 hours of live online classes plus six months of access to the complete TTP EA OnDemand course.
  • 165+ EA Score Guarantee
  • 4,100+ Quant, Verbal, and Integrated Reasoning practice questions
  • 400+ hours of in-depth video lessons
  • 3,000+ step-by-step video solutions
View EA class & enroll
Limited cohort · enrollment openTarget Test Prep
GMATOnDemand Start anytime
SELF-PACED MASTERCLASS

Target Test Prep GMAT OnDemand

Complete access from day one. Study on your schedule.

715+ score guarantee
$0to start then $127/mo
  • Personalized study plan and analytics
  • Thousands of lessons and practice questions

Compare the format, schedule, and included access before enrolling. Prices and seat counts shown reflect the supplied offer details.

Divisors

Expert replies
Source: — Problem Solving |

by Frankenstein » Wed Jun 22, 2011 10:15 pm
Hi,
if a number N = a^p. b^q.c^r.... where a,b,c are prime factors, then the number of factors is given by:
(p+1)*(q+1)*(r+1)*...
Here the number is p^3*q^6
So, number of factors is (3+1)8(6+1) = 28

Hence, D
Cheers!

Things are not what they appear to be... nor are they otherwise
Join the discussion

by MBA.Aspirant » Wed Jun 22, 2011 11:16 pm
Frankenstein wrote:Hi,
if a number N = a^p. b^q.c^r.... where a,b,c are prime factors, then the number of factors is given by:
(p+1)*(q+1)*(r+1)*...
Here the number is p^3*q^6
So, number of factors is (3+1)8(6+1) = 28

Hence, D
Thanks man. Does this formula apply to finding the factors in general? Like when you do prime factorization you can use it then to find the factors?
Join the discussion

by Frankenstein » Wed Jun 22, 2011 11:21 pm
MBA.Aspirant wrote: Thanks man. Does this formula apply to finding the factors in general? Like when you do prime factorization you can use it then to find the factors?
Yes. That is my purpose of writing the formula. I have mentioned about the prime factors thing as well.
Cheers!

Things are not what they appear to be... nor are they otherwise
Join the discussion

by GMATGuruNY » Thu Jun 23, 2011 3:37 am
MBA.Aspirant wrote:
Frankenstein wrote:Hi,
if a number N = a^p. b^q.c^r.... where a,b,c are prime factors, then the number of factors is given by:
(p+1)*(q+1)*(r+1)*...
Here the number is p^3*q^6
So, number of factors is (3+1)8(6+1) = 28

Hence, D
Thanks man. Does this formula apply to finding the factors in general? Like when you do prime factorization you can use it then to find the factors?
It might be helpful to understand the reasoning behind the formula offered by Frankenstein.

To determine the number of positive factors of an integer:

1) Prime-factorize the integer
2) Add 1 to each exponent
3) Multiply


For example:
72 = 2³ * 3².
Adding 1 to each exponent and multiplying, we get (3+1)*(2+1) = 12 factors.

Here's why:
To determine how many factors can be created from 72 = 2³ * 3², we need to determine the number of choices we have of each prime factor and to count the number of ways these choices can be combined:

For 2, we can use 2�, 2¹, 2², or 2³, giving us 4 choices.
For 3, we can use 3�, 3¹, or 3², giving us 3 choices.

Multiplying the number of choices we have of each factor, we get 4*3 = 12 possible factors.

Regarding the following question:
If p and q are prime numbers, how many divisors does the product P^3 *q^6 have?

(A) 9
(B) 12
(C) 18
(D) 28
(E) 36
The question needs to say that p and q are distinct prime numbers and that we are to count the number of positive divisors. Assuming p and q are distinct, we add 1 each exponent and multiply:
(3+1)(6+1) = 4*7 = 28.

If p and q are not distinct, then p³q� = p³p� = p�, yielding only 9+1 = 10 factors.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3
Join the discussion

by finites » Thu Jun 23, 2011 10:59 am
Thnks GMATGuruNY..
Was wondering why plus one ..
Join the discussion

by hirenvpatel.mba » Thu Jun 23, 2011 12:06 pm
@finites ... 'plus 1' because of 2^0 and 3^0 (in choices) in GMATGuruNY's explanation.
Join the discussion

by MBA.Aspirant » Fri Jun 24, 2011 4:49 am
GMATGuruNY wrote:
MBA.Aspirant wrote:
Frankenstein wrote:Hi,
if a number N = a^p. b^q.c^r.... where a,b,c are prime factors, then the number of factors is given by:
(p+1)*(q+1)*(r+1)*...
Here the number is p^3*q^6
So, number of factors is (3+1)8(6+1) = 28

Hence, D
Thanks man. Does this formula apply to finding the factors in general? Like when you do prime factorization you can use it then to find the factors?
It might be helpful to understand the reasoning behind the formula offered by Frankenstein.

To determine the number of positive factors of an integer:

1) Prime-factorize the integer
2) Add 1 to each exponent
3) Multiply


For example:
72 = 2³ * 3².
Adding 1 to each exponent and multiplying, we get (3+1)*(2+1) = 12 factors.

Here's why:
To determine how many factors can be created from 72 = 2³ * 3², we need to determine the number of choices we have of each prime factor and to count the number of ways these choices can be combined:

For 2, we can use 2�, 2¹, 2², or 2³, giving us 4 choices.
For 3, we can use 3�, 3¹, or 3², giving us 3 choices.

Multiplying the number of choices we have of each factor, we get 4*3 = 12 possible factors.

Regarding the following question:
If p and q are prime numbers, how many divisors does the product P^3 *q^6 have?

(A) 9
(B) 12
(C) 18
(D) 28
(E) 36
The question needs to say that p and q are distinct prime numbers and that we are to count the number of positive divisors. Assuming p and q are distinct, we add 1 each exponent and multiply:
(3+1)(6+1) = 4*7 = 28.

If p and q are not distinct, then p³q� = p³p� = p�, yielding only 9+1 = 10 factors.
Thanks GMATGuru for your help. The part about the non-distinct factors was very helpful. I just faced it with 64 where the factors are/is 2^6. the number of factors then is (6+1) not (3+1) * (3+1)
Join the discussion