Write a program to count the number of prime factors of a given positive integer and calculate the difference between the number and the lowest prime factor.ExampleInput: 30 Output: 3 28Explanation: The number of prime factors is 3 (prime factors of 30 are 2, 3, and 5). The difference between the number (30) and the lowest prime factor (2) is 28.Note: This question was asked in the Wipro coding test.Input format :The input consists of an integer N, representing the positive integer.Output format :The output displays the count of prime factors and the difference between the given number and the lowest prime factor separated by a space.

Write a program to count the number of prime factors of a given positive integer and calculate the difference between the number and the lowest prime factor.

Write a Java program that takes a positive integer as input and performs prime factorization using a while loop. The program should display the prime factors of the given number.Ensure the program handles invalid input gracefully, providing appropriate messages

Problem StatementAnna is working on a program to find common factors of two unsigned integers. Design a program that:Takes two unsigned integers: n1 and n2, as input.Identifies and prints all common factors of these numbers.For example, Let us take two numbers 24 and 36. The factors of 24 are 1, 2, 3, 4, 6, 8, 12, 24. The factors of 36 are 1, 2, 3, 4, 6, 9, 12, 36. The common factors of 24 & 36 are 1,2,3,4,6,12 Ensure the program accurately identifies common factors, providing correct results for various inputs.Input format :The input consists of two unsigned integers n1 and n2 separated by a space.Output format :The output prints the common factors of n1 and n2, separated by a space.

Tony is exploring functions and needs your help. Write a program to assist Tony where he inputs an integer N. The program should display the factors of N and count how many digits N has. Help him with the program using call-by-reference.Function Specifications:To display factors - void factors(int ); To display digits - int count_digits(int *);Input format :The input consists of an integer N.Output format :The first line of output prints "Factors: " followed by the factors of N, separated by a space.The second line of output prints "Total digits: " followed by the total digits of N.

The input begins with the number t of test cases in a single line (t<=10). In each of the next t lines there are two numbers m and n (1 <= m <= n <= 1000000000, n-m<=100000) separated by a space.OutputFor every test case print all prime numbers p such that m <= p <= n, one number per line, test cases separated by an empty line.ExampleInput:21 103 5Output:235735