.
\n" );
document.write( "\r\n" );
document.write( "The integer number 130 has this decomposition into the product of these prime numbers:\r\n" );
document.write( "\r\n" );
document.write( "130 =
.
.
=
.
.
.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Note that the indexes are 1 for 2, 1 for 5 and 1 for 13.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Now add 1 to each of the three indexes:\r\n" );
document.write( "\r\n" );
document.write( "1 + 1 = 2 (for 2);\r\n" );
document.write( "\r\n" );
document.write( "1 + 1 = 2 (for 5);\r\n" );
document.write( "\r\n" );
document.write( "1 + 1 = 2 (for 13).\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "Now the number of all divisors for 130 (including 1 and including 130 itself) is the product 2*2*2 = 8.\r\n" );
document.write( "\r\n" );
document.write( "\r\n" );
document.write( "They are\r\n" );
document.write( "\r\n" );
document.write( "1 =
,\r\n" );
document.write( "\r\n" );
document.write( "2 =
,\r\n" );
document.write( "\r\n" );
document.write( "5 =
,\r\n" );
document.write( "\r\n" );
document.write( "10 =
,\r\n" );
document.write( "\r\n" );
document.write( "13 =
,\r\n" );
document.write( "\r\n" );
document.write( "26 =
,\r\n" );
document.write( "\r\n" );
document.write( "65 =
,\r\n" );
document.write( "\r\n" );
document.write( "130 =
.\r\n" );
document.write( "
\r
\n" );
document.write( "\n" );
document.write( "The answer to your problem is the option a): there are 8 divisors.\r
\n" );
document.write( "
\n" );
document.write( "
\n" );
document.write( "\n" );
document.write( " \n" );
document.write( "