Cryptographic hashes have many different properties that make them useful and distinct. The most fundamental properties the Collatz function shares with hash functions include it being deterministic and non-invertable. Applying the modulo operation to map the input/output to a finite field provides uniformity. Change the function to b^k and you have the discrete logarithm problem.