PHP: Highly divisible triangular number (ProjectEuler Problem #12)

PHP: Highly divisible triangular number.php

<?php

function countDivisors($number)
{
    $count = 0;
    $sqrtOfNumber = (int)sqrt($number);
    for($i = 1; $i <= $sqrtOfNumber; $i++)
    {
        if($number % $i == 0)
            $count += 2;
    }
    
    return sqrt($sqrtOfNumber) == $number ? $count-- : $count;
}
 
$n = 0;
$i = 1;
while(countDivisors($n) < 500){
    echo 'Checking: '.$n." \n";
    $n += $i;
    $i++;
}
 
echo $n;

https://gist.github.com/FakeHeal/ea9c42592db83aad2bba#file-php-highly-divisible-triangular-number-php-L9-L14

Need to be refactored ! ! ! ASAP