Although there was a prime factors challenge posted ten years ago, it has tedious I/O and restricted time. In this challenge, your task is to write a program or function which takes an integer \$n \ge 2\$ as input, and returns its prime factors.
Task:
Input will consist of an integer, \$n \ge 2\$. Your program should theoretically work for arbitrarily large numbers, but can fail due to limits like integer overflow.
Your program should print/return the prime factors (in any order), in any reasonable representation. For example, 180 could be represented as [2, 2, 3, 3, 5], or "2 3 5 2 3", or through any other collection type or string representation.
Test cases:
2 [2] 3 [3] 6 [2, 3] 12 [2, 2, 3] 25 [5, 5] 180 [2, 2, 3, 3, 5] 181 [181] Other:
Any trivial built-in answers should go in this community wiki.
This is code-golf, so shortest answer (in bytes) per language wins.
