title: Support in implementig factor of positive integer
body: <p>Hello I am new programer, and I need little-bit support how can I solve this simple task</p>
  
  <p>A positive integer D is a factor of a positive integer N if there exists an integer M such that N = D * M.</p>
  
  <p>For example, 6 is a factor of 24, because M = 4 satisfies the above condition (24 = 6 * 4).</p>
  
  <p>Write a function:</p>
  
  <pre><code>class Solution { public int count_factors(int N); } 
  </code></pre>
  
  <p>that, given a positive integer N, returns the number of its factors.</p>
  
  <p>For example, given N = 24, the function should return 8, because 24 has 8 factors, namely 1, 2, 3, 4, 6, 8, 12, 24. There are no other factors of 24.</p>
  
  <p>Assume that:</p>
  
  <pre><code>N is an integer within the range [1..2,147,483,647]
  </code></pre>
  
  <p>Complexity:</p>
  
  <pre><code>expected worst-case time complexity is O(sqrt(N))
  expected worst-case space complexity is O(1)
  </code></pre>