## Highly divisible triangular number

EASY General

The sequence of triangle numbers is generated by adding natural numbers.
So the 7th triangle number would be `1 + 2 + 3 + 4 + 5 + 6 + 7 = 28.` The first ten terms would be:

`1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...`

Let us list the factors of the first seven triangle numbers:

``` 1: 1  3: 1,3  6: 1,2,3,6 10: 1,2,5,10 15: 1,3,5,15 21: 1,3,7,21 28: 1,2,4,7,14,28```

We can see that 28 is the first triangle number to have over five divisors.
What is the value of the first triangle number to have over five hundred divisors?

This is a Project Euler Problem: https://projecteuler.net/problem=12

NOTE These questions can be solved in either Java , Python , Rust, C++, Go or ! However, the language intended for these questions is mentioned along with the question on the top. You need to submit the solution file for the autograder to grade the submission. If you are submitting in Java, make sure that the class name is Main (with a capital M)

Optional Python Editor for your use

Optional Java Editor for your use