Prime Notary

Prime Notary is an esolang by user Ϫ. It is based on the principle of prime notation.

Prime notation is a system where any integer can be expressed by a series of prime terms, multiplied together:

2^a X 3^b X 5^c...

The prime number itself is known as a root, and the power is known (ironically) as the factor.

Instructions

Caption text
Header text	Header text
aN+	Increases the factor of the given root by 1.
a+	Increases the value of the variable by 1, and then recalculates the notation.
aN-	Decreases the factor of the given root by 1.
a-	Decreases the value of the variable by 1, and then recalculates the notation.
a!	Sets jump point A
>a	Goes to jump point A
ab?2	Checks if the first variable given has a larger factor in the specified root than the second one. If it does, it executes the next line of code. If it doesn't, it skips it.
ab?	Checks if the first variable given has a larger overall value than the second If it does, it executes the next line of code. If it doesn't, it skips it.
a>	Outputs A as an integer
a>>	Outputs A as an ASCII code.
!	Halts the program.

The character $ can be used as a variable, but initially is set to the user's input.
If an invalid instruction is shown, it simply halts, much like a Turing machine.

>a
b!
b>
!
a!
$b?
>b
c!
$>
>c

$>

sorry but i'm too lazy to work out prime notarization for the giant ascii values for hello world. can someone fix this?