Problem Statement:Given a number check whether the number is deficient number or not.DEFICIENT NUMBER :  A deficient number or defective number  is a number for which the sum of proper divisors is less than n. For example, the proper divisors of 8 are 1, 2, and 4, and their sum is less than 8, so 8 is deficientInput Format:Given an integer n .Output Format:Print Yes if it is a deficient number or No .Sample Input 1:8Sample Output 1:YesSample Input 2:6Sample Output 2:No

Output format :Print’1’ if n is a perfect number, else print the sum of the proper divisors of n.The output will be matched to the candidate’s output printed on STDOUTCode constraints :0< n <109Sample test cases :Input 1 :22Output 1 :14

Single File Programming QuestionProblem StatementBeula is solving a mathematical problem and seeks your assistance in writing a program. She is particularly interested in finding numbers with exactly 9 factors. Help her by creating a program that takes an integer N as input and identifies numbers from 1 to N that have exactly 9 factors.Function Specifications:check_9_factors - Prints the integers that have exactly 9 divisors as well as the total number of such integers.Note: This question helps in clearing technical coding tests for companies like Infosys.Input format :The input consists of an integer N.Output format :The first line displays space-separated integers representing numbers from 1 to N that have exactly 9 factors.The second line displays a single integer representing the count of numbers with exactly 9 factors.Refer to the sample output for formatting specifications.Code constraints :In this scenario, the test cases fall under the following constraints:100 ≤ N ≤ 1500Sample test cases :Input 1 :100Output 1 :36 100 2Input 2 :150Output 2 :36 100 2Input 3 :1500Output 3 :36 100 196 225 256 441 484 676 1089 1156 1225 1444 12Note :The program will be evaluated only after the “Submit Code” is clicked.Extra spaces and new line characters in the program output will result in the failure of the test case.

Write a program to check the given number is perfect or not ?Constraints:1<n<1000Input FormatAn integer nOutput FormatA corresponding stringExample:Input 1:6Output 1:YesInput 2:3Output 2:No

A perfect number is a positive integer that is equal to the sum of its proper positive divisors, i.e. the sum of its positive divisors excluding the number itself.You are given a function,def DetectPerfectNumber(n)The function accepts an integer 'n' as its argument. Implement the function such that it returns '1' if 'n' is a perfect number, else returns the sum of the proper divisors of 'n'.Example:Input:22Output:14Explanation: Proper positive divisors of 22 are 1, 2 and 11. 1 + 2 + 11 = 14 which is not equal to 22, hence 22 is not a perfect number. So the output is 14 which is the sum of its proper divisors.The custom input format for the above case:22(The line represents 'n')

Write a program to check the given number is perfect or not ?Constraints:1<n<1000Input FormatAn integer nOutput FormatA corresponding stringExample:Input 1:6Output 1:YesInput 2:3Output 2:No Explanation:Sum of factors of the given number must be equal to the numberFactors of 6 are 1,2,3 . 1+2+3=6 which is equal to the given number. So 6 is a perfect number