Order Types and Well-Orderings

Two ordered sets have the same order type when an order-preserving bijection links them; a well-order (every non-empty subset has a least element) has a unique ordinal as its order type, so being well-ordered and unbounded above does not make a set look like $\mathbb{N}$.