The output from a cryptographic hash algorithm has as many bits of entropy in it as the input does, up to the maximum size of the hashing algorithm. A good cryptographic hash aims to distill and evenly distribute entropy. Distilling means the output takes all of the entropy of the input and has it in the output, which is a fixed size, potentially much less size than the input. Evenly distributing means that if the input has 8 bits of entropy in the first character and no bits of entropy in the other characters, the output hash will have 8 bits of randomness equally distributed through out every character. So the hash of "a" is still much less secure than the hash of "uteyvw5i697895t45ytf495w6f4t6t9548t943t34t456iotui4ru5o3u54io9t586y843t654989kfwlejtiueh5i"