Check If my String is Prime We define a prime character as a character that has a prime ASCII value. We define a prime string as a String that only contains prime characters.

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.

Test Cases

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.
Jelly, 4 bytes
OÆPẠ

Try it online!
Explanation
Remember that a string is an array of characters, so operations like O will apply to each individual character.
OÆPẠ
O        Ord; cast each character to a number
 ÆP      Is it ÆPrime? gives 1 for truthy and 0 for falsey
   Ạ     Ạll; returns 1 if the array contains no falsey values