Given a number **N**, the task is to print all the factors of N using recursion.

**Examples:**

Input:N = 16

Output:1 2 4 8 16

Explanation:

1, 2, 4, 8, 16 are the factors of 16. A factor is a number which divides the number completely.

Input:N = 8

Output:1 2 4 8

**Approach:** The idea is to create a function that takes 2 arguments. The function is recursively called from 1 to N and in every call, if the number is a factor of N, then it is printed. The recursion will stop when the number exceeds N.

Below is the implementation of the above approach:

## C++

`// C++ program to find all the factors ` `// of a number using recursion ` ` ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Recursive function to ` `// print factors of a number ` `void` `factors(` `int` `n, ` `int` `i) ` `{ ` ` ` `// Checking if the number is less than N ` ` ` `if` `(i <= n) { ` ` ` `if` `(n % i == 0) { ` ` ` `cout << i << ` `" "` `; ` ` ` `} ` ` ` ` ` `// Calling the function recursively ` ` ` `// for the next number ` ` ` `factors(n, i + 1); ` ` ` `} ` `} ` ` ` `// Driver code ` `int` `main() ` `{ ` ` ` `int` `N = 16; ` ` ` `factors(N, 1); ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find all the factors ` `// of a number using recursion ` ` ` `class` `GFG { ` ` ` ` ` `// Recursive function to ` ` ` `// print factors of a number ` ` ` `static` `void` `factors(` `int` `n, ` `int` `i) ` ` ` `{ ` ` ` ` ` `// Checking if the number is less than N ` ` ` `if` `(i <= n) { ` ` ` `if` `(n % i == ` `0` `) { ` ` ` `System.out.print(i + ` `" "` `); ` ` ` `} ` ` ` ` ` `// Calling the function recursively ` ` ` `// for the next number ` ` ` `factors(n, i + ` `1` `); ` ` ` `} ` ` ` `} ` ` ` `// Driver code ` ` ` `public` `static` `void` `main(String args[]) ` ` ` `{ ` ` ` `int` `N = ` `16` `; ` ` ` `factors(N, ` `1` `); ` ` ` `} ` `} ` |

*chevron_right*

*filter_none*

## Python3

`# Python3 program to find all the factors ` `# of a number using recursion ` ` ` `# Recursive function to ` `# prfactors of a number ` `def` `factors(n, i): ` ` ` ` ` `# Checking if the number is less than N ` ` ` `if` `(i <` `=` `n): ` ` ` `if` `(n ` `%` `i ` `=` `=` `0` `): ` ` ` `print` `(i, end ` `=` `" "` `); ` ` ` ` ` `# Calling the function recursively ` ` ` `# for the next number ` ` ` `factors(n, i ` `+` `1` `); ` ` ` `# Driver code ` `if` `__name__ ` `=` `=` `'__main__'` `: ` ` ` `N ` `=` `16` `; ` ` ` `factors(N, ` `1` `); ` ` ` `# This code is contributed by Rajput-Ji ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find all the factors ` `// of a number using recursion ` ` ` `using` `System; ` ` ` `class` `GFG { ` ` ` ` ` `// Recursive function to ` ` ` `// print factors of a number ` ` ` `static` `void` `factors(` `int` `n, ` `int` `i) ` ` ` `{ ` ` ` ` ` `// Checking if the number is less than N ` ` ` `if` `(i <= n) { ` ` ` `if` `(n % i == 0) { ` ` ` `Console.WriteLine(i + ` `" "` `); ` ` ` `} ` ` ` ` ` `// Calling the function recursively ` ` ` `// for the next number ` ` ` `factors(n, i + 1); ` ` ` `} ` ` ` `} ` ` ` ` ` `// Driver code ` ` ` `public` `static` `void` `Main() ` ` ` `{ ` ` ` `int` `n = 16; ` ` ` `factors(n, 1); ` ` ` `} ` `} ` |

*chevron_right*

*filter_none*

**Output:**

1 2 4 8 16

**Time Complexity:** O(N)

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Find number of factors of N when location of its two factors whose product is N is given
- Find product of all elements at indexes which are factors of M for all possible sorted subsequences of length M
- Generating all possible Subsequences using Recursion
- Move all occurence of letter 'x' from the string s to the end using Recursion
- Program for length of a string using recursion
- Program to check if an array is palindrome or not using Recursion
- C++ Program to print an Array using Recursion
- Sum of Factors of a Number using Prime Factorization
- Decimal to Binary using recursion and without using power operator
- Find the value of ln(N!) using Recursion
- Find the node with maximum value in a Binary Search Tree using recursion
- Find Maximum Level Sum in Binary Tree using Recursion
- Find geometric sum of the series using recursion
- Decimal to binary number using recursion
- Sum of digit of a number using recursion
- Count Set-bits of number using Recursion
- Add the given digit to a number stored in a linked list using recursion
- Count the occurrence of digit K in a given number N using Recursion
- How to solve problems related to Number-Digits using Recursion?
- Print all combinations of factors (Ways to factorize)

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.