Highly divisible triangular number

from math import sqrt 
import time 
def natSum(n):
    x = 1
    count = 0
    sum = 0
    while count <= n:
        sum += x
        count = 0
        for i in range(1,int(sqrt(sum))+1):
            if sum % i == 0:
                count += 2
        if sqrt(sum)==int(sqrt(sum)): 
                count -= 1
        print x,sum,count,n

        x += 1
    
natSum(500)
'''
start=time.time() 
now=2
num=1
t = 0
while t <= 500 : 
    num=num+now 
    now+=1
    t=0
    for x in range(1,int(sqrt(num))+1): 
        if num%x==0: 
            t+=2
    if sqrt(num)==int(sqrt(num)): 
        t=t-1

    print num
print num 
print time.time()-start 
'''