Given a String that only contains printable ASCII, determine whether that String is prime.
Input / Output
You can take input either as a String or as a list of individual characters. You have to output two different and consistent values depending on whether the String is prime, following the standard rules for a decision-problem. You are guaranteed that the input will be non-empty.
Truthy cases (Prime Strings):
"aeg" "aIS5" "aaaaaaaaaaaaaa" "/S/S" "=;+"
Falsy cases (not Prime Strings):
"maTHS" "Physics" "\\\\" "PPCG" "Code Golf" "Prime"
This is code-golf, so the shortest code in bytes wins! Standard rules for this tag apply.