All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Large factor product (Posted on 2023-05-10) Difficulty: 2 of 5
The product of all factors of n is 2,176,782,336,000,000,000,000,000,000,000,000

Find n.

If I told you 612=2,176,782,336 you shouldn't need a calculator.

No Solution Yet Submitted by Jer    
Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Analytic Solution Comment 4 of 4 |
Lets take some arbitrary number, call it N. Also say N has F factors, including 1 and N. 

Pair the factors of N such that each pair's product equals N; if N is a perfect square then sqrt(N) will be by itself. 
The geometric mean of each pair is sqrt(N), so then collectively the geometric mean of all the factors of N is sqrt(N).
But then this makes the product of all factors easy to compute as N^(F/2).

Lets go a bit deeper and let N be a number with exactly three prime factors of 2, 3, and 5. Then N = 2^x * 3^y * 5^z and F = (x+1)*(y+1)*(z+1).
Then N^(F/2) = 2^[x*(x+1)*(y+1)*(z+1)/2] * 3^[(x+1)*y*(y+1)*(z+1)/2] * 5^[(x+1)*(y+1)*z*(z+1)/2].

Now to tune in on this problem, N^(F/2) is given as 6^12 * 10^24 = 2^36 * 3^12 * 5^24.
Then we can create the following system by equating the two expressions for N^(F/2) and matching the exponents
x*(x+1)*(y+1)*(z+1)/2 = 36
(x+1)*y*(y+1)*(z+1)/2 = 12
(x+1)*(y+1)*z*(z+1)/2 = 24

Taking ratios of these equations gives us that x:y:z = 3:1:2.  Since we are interested in positive integers then the obvious answer is x=3, y=1, and z=2, which does satisfy the system of equations.  Then N = 2^3 * 3^1 * 5^2 = 600.

  Posted by Brian Smith on 2023-05-12 12:46:26
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information