Many applications of choice can be removed when we restrict attention to well-orderable - or even better, countable - fields and other objects. As Asaf says, however, there are nonetheless some facts which really do require the axiom of choice. At the same time, these often have slight weakenings that (a) don't require choice and (b) do everything we really need (e.g. that there is only one countable algebraic closure of $\mathbb{Q}$ up to isomorphism).
You might be concerned at this point about results in "concrete" mathematics which go through principles with no apparent choice-free proof. E.g. is it possible that the Riemann hypothesis could be proved, but only using choice due to its reliance on some "choicey" piece of algebraic geometry? It turns out that there is a very powerful metatheorem which says that the answer is "no:" Shoenfield absoluteness. In particular, this implies that if ZFC proves the Riemann hypothesis, or Goldbach, or Fermat's last theorem, or basically any fact from number theory or "low-level" algebraic geometry, then so does ZF. In fact it says much more: it says e.g. that we can also through arithmetic axioms like GCH onto the pile while still not changing the provability of the Riemann hypothesis. The motto I would give here is that Shoenfield absoluteness shows that number theory doesn't rely on choice.