A critical statistic for a hash table is the load factor, that is the number of entries divided by the number of buckets:
Load factor $= n/k$
where:
$n =$ number of entries
$k =$ number of buckets
As the load factor grows larger, the hash table becomes slower, and it may even fail to work (depending on the method used).
Here, load factor = $\text{2000/25 = 80}$