This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
First we need to find all prime factors (you will need some paper to do that...) What you'll find after making the tree of primes will look somehow like this:
7 8 7 0 2 6 2 4 ∣ 2
3 9 3 5 1 3 1 2 ∣ 2
1 9 6 7 5 6 5 6 ∣ 2
9 8 3 7 8 2 8 ∣ 2
4 9 1 8 9 1 4 ∣ 2
2 4 5 9 4 5 7 ∣ 3
8 1 9 8 1 9 ∣ 3
2 7 3 2 7 3 ∣ 3
9 1 0 9 1 ∣ 7
1 3 0 1 3 ∣ 7
1 8 5 9 ∣ 1 1
1 6 9 ∣ 1 3
1 3 ∣ 1 3
1
Then, we should write every prime number, however, with exponential signs:
2 5 × 3 3 × 7 2 × 1 1 1 × 1 3 2 = 7 8 7 0 2 6 2 4
Then we take all exponents, add one to each of them and multiply all of them with each other. The result will be the answer of the question:
( 5 + 1 ) × ( 3 + 1 ) × ( 2 + 1 ) × ( 1 + 1 ) × ( 2 + 1 ) = 4 3 2