2 is the minimum factor of number other than 1. So calling recursive function to find number of ways of factoring N with all factors greater than 1
System . out . println ( 1 + getDivisors ( 2 , n ) ) ; } }