This question already has an answer here:
Question is just out of interest.
If we take md5 hash from all integers from 1 to n, what is the first n, where its md5 collides with some previous md5?
Has anyone ever calculated and proved the smallest integer, where the collision occurs?
If not, is there considerations about md5 pseudo-randomness, which make probability of colliding md5-s higher for consecutive integers than for cryptographically random strings (birthday attack -> 2^64)?
This, for example, might be useful to know, when trying to hide real sequential order numbers.