To manage prime-number capacity used by storages with HASHABLE elements. To search some element,
the first access is done using the remainder of the division of the element hash_code
by capacity. In order to try to avoid clashes, capacity is always a prime number (selected
using HASH_TABLE_SIZE).