Japt, (削除) 26 (削除ここまで) (削除) 24 (削除ここまで) 23 bytes

Ew! Don't think I've ever been more jealous of languages with built-ins for lists of primes and exponents and what-not :\

Input is an array of codepoints. Saved byte by borrowing Arnauld's formula.

£_j}iY p#a×ばつ

Try it

£_j}iY p#a×ばつ :Implicit input of codepoint array
£ :Map each X at index Y
 _ : Function taking an integer as argument
 j : Is prime?
 } : End function
 iY : Get the Yth integer that returns true
 p : Raise to the power of
 #a88 : 17088
 ÷X : Divide by X
 %75 : Mod 75
 %E : Mod 14
 |1 : Bitwise OR with 1
 Ã :End map
 ×ばつ :Reduce by multiplication

Japt, (削除) 26 (削除ここまで) (削除) 24 (削除ここまで) 23 bytes

Ew! Don't think I've ever been more jealous of languages with built-ins for lists of primes and exponents and what-not :\

Input is an array of codepoints. Saved a byte by borrowing Arnauld's formula.

£_j}iY p#a×ばつ

Try it

£_j}iY p#a×ばつ :Implicit input of codepoint array
£ :Map each X at index Y
 _ : Function taking an integer as argument
 j : Is prime?
 } : End function
 iY : Get the Yth integer that returns true
 p : Raise to the power of
 #a88 : 17088
 ÷X : Divide by X
 %75 : Mod 75
 %E : Mod 14
 |1 : Bitwise OR with 1
 Ã :End map
 ×ばつ :Reduce by multiplication

Japt, (削除) 26 (削除ここまで) (削除) 24 (削除ここまで) 23 bytes

Ew! Don't think I've ever been more jealous of languages with built-ins for lists of primes and exponents and what-not :\

Input is an array of codepoints. Saved byte by borrowing Arnauld's formula.

£_j}iY p#a×ばつ

Try it

(Outdated explanation)

Ën"..." ÑÄÃí!p_j}jUl×ばつ :Implicit input of character array U
Ë :Map n"..." : Convert from base "0s~|A()" to base-10 integer
 Ñ : Multiply by 2
 Ä : Add 1
 Ã :End map
 í :Interleave with
  !p :And reduce each pair by inverse exponentiation
 _ : Function taking an integer as argument
 j : Is prime?
 } : End function
  j : Generate an array of integers that return true of length
 Ul : Length of U
 1 :End interleave
 ×ばつ :Reduce by multiplication

Japt, (削除) 26 (削除ここまで) (削除) 24 (削除ここまで) 23 bytes

Ew! Don't think I've ever been more jealous of languages with built-ins for lists of primes and exponents and what-not :\

Input is an array of codepoints. Saved byte by borrowing Arnauld's formula.

£_j}iY p#a×ばつ

Try it

£_j}iY p#a×ばつ  :Implicit input of codepoint array
£  :Map each X at index Y
 _ : Function taking an integer as argument
 j : Is prime?
 } : End function
 iY : Get the Yth integer that returns true
 p : Raise to the power of
 #a88 : 17088
 ÷X : Divide by X
 %75 : Mod 75
 %E : Mod 14
  |1 : Bitwise OR with 1
  Ã :End map
 ×ばつ :Reduce by multiplication

Japt, (削除) 26 (削除ここまで) 24 bytes

Ew! Don't think I've ever been more jealous of languages with built-ins for lists of primes and exponents and what-not :\

£_j}iY pXn"0s~|A()" ×ばつ

Try it

(Outdated explanation)

Ën"..." ÑÄÃí!p_j}jUl×ばつ :Implicit input of character array U
Ë :Map
 n"..." : Convert from base "0s~|A()" to base-10 integer
 Ñ : Multiply by 2
 Ä : Add 1
 Ã :End map
 í :Interleave with
 !p :And reduce each pair by inverse exponentiation
 _ : Function taking an integer as argument
 j : Is prime?
 } : End function
 j : Generate an array of integers that return true of length
 Ul : Length of U
 1 :End interleave
 ×ばつ :Reduce by multiplication

Japt, (削除) 26 (削除ここまで) (削除) 24 (削除ここまで) 23 bytes

Ew! Don't think I've ever been more jealous of languages with built-ins for lists of primes and exponents and what-not :\

Input is an array of codepoints. Saved byte by borrowing Arnauld's formula.

£_j}iY p#a×ばつ

Try it

(Outdated explanation)

Ën"..." ÑÄÃí!p_j}jUl×ばつ :Implicit input of character array U
Ë :Map
 n"..." : Convert from base "0s~|A()" to base-10 integer
 Ñ : Multiply by 2
 Ä : Add 1
 Ã :End map
 í :Interleave with
 !p :And reduce each pair by inverse exponentiation
 _ : Function taking an integer as argument
 j : Is prime?
 } : End function
 j : Generate an array of integers that return true of length
 Ul : Length of U
 1 :End interleave
 ×ばつ :Reduce by multiplication