We Draw a graph to represent how are acting the multiples:

To view in full screen click here

**s(n)**: It’s the **sum of divisors** up to n including n.**s(n)**: It’s the **sum of divisors** up to n, not including n. It’s **s(n)-n**.

- si
**s(n)=1**the number is**prime**.

- si
**s(n)<n**the number is**deficient**.

- si
**s(n)=n**the number is**perfect**.

- si
**s(n)>n**the number is**abundant**.

Based on the proposed E.Pol Omar and programmed by Jason-Davies.**Are you able to detect a pattern to the prime numbers?**