project euler problem12 - this script takes too long time to solve problem

problem12_euler.py

#!/usr/bin/python

#this script takes long time to get the first number that has 500 divisors

number = 0
for i in range(1,10000):
	number += i
	s = 0
	for x in range(1,number+1):
		if number % x == 0 :
			s += 1
	if s == 500 :
		print number ,'is the first number that has 500 divisors'
		break