insidcode
ProblemsDuelLeaderboardStats
Sign In
  1. Home
  2. Problems
  3. Perfect Number Check

Perfect Number Check

Difficulty: Medium

Phase: 2 · Looping and Patterns

XP Reward: 20 XP

Topics: Looping and Patterns, Medium

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Check if positive integer N equals the sum of its proper divisors. Print 'Yes' or 'No'. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

  • -10^9 <= N <= 10^9

Examples

Example 1

Input: 6

Output: Yes

Explanation: Sample execution for input 6