Is an approximation okay? I have some algorithms that could work for you and I am working on some more A very small and easy algorithm looks like this:
(This is not Axe code, but it will work very nicely for 32-bit integers)
65535→B          ;just the initial condition. Feel free to experiment, this can be anything. (try 32767?)
Repeat abs(X-B)<2
(B+X/B)/2→B
End
It will need at most 16 iterations for a 32-bit number (fewer iterations for larger numbers) for a 32-bit number. There are, however, faster methods, but I don't know how to do it in Axe Again, I could write some assembly code, possibly or a mix of Assembly and Axe.

EDIT: Fixed my code, I accidentally forgot to remove some scratch work

Awww, the names sound so cuutte! Also, I cannot wait to try it! I cannot draw sprites well, but what size should they be?

As a note that I am sure everybody realises (but I will still go into some detail), the shifting left occurs because in binary that is multiplying by 2 (you can also add it to itself) and this is because it is base 2. When you do that, you are just adding a zero to the end of the number. In the more familiar base of base 10 (or any base above 2), you have to worry about intermediate carry stuff, but it is pretty much the same. If I wanted to do 367*183, it would look like this
183 shift left is 83 with 1 as the digit to use
1*367=367, this is what we add to the accumulator
Shift the 83 left and we have 3 (well, 300), and 8 is the digit to check
Shift the accumulator left to multiply by 10
8*367=2936, this we add to the accumulator
Acc=6606
Acc shifted left to multiply by 10
shift left to get the 3
3*367=1101, add this to the accumulator
Acc=67161

Check it and it works Pretty much, you are doing multiplication "the normal way", but backwards (last digit first). If you notice, the first result was multiplied by a total of 100 which fits (we did 1*367 for 100*367).

Hmm, well Grammer has some functions not found in Axe for things like graphics and math (like tilemapping, particle stuff), but on the otherhand, Axe I am pretty sure lets you do grayscale easier and gives you the power of interrupts (Grammer does somewhat). Axe is a bit faster at most things, but Grammer code is usually much smaller. Since Axe compiles the program to assembly, it can be easily used on other calcs and does not rely on the version. Since Grammer is interpreted, you need to have it on your calc and if a game was made with the newest features, you may need users to update their version of Grammer to the newest.

So there are definitely reasons for both I don't know Axe well, but I think TBO_Yeong and Sorunome know both languages

EDIT2: This code does not work yet

Okay
I have not tested this code, but it might work for 32/16:
A/C→D
A^C*256+B/256→A
B*256→B
D+A/C→D
A^C*256+B/256→A
A^C→E
D+A/C→D
It does AB/C and returns the division in D and the mod in E
(well, it is supposed to)

EDIT: Made it faster/smaller

o.o Okay, I see why you need this, now. Are you saying you want to factor a number (I am an almost mathematician, so I understand your words). You mean like 78 is 2*3*13?

I can see what I can do... I know I could do the math parts in assembly, but it may take a while

There were no mistakes that I could see actually
As for your question, I do not believe Axe normally supports 4-byte (32-bit/octet) values
I might have a hex opcode for 32 bit/16 bit and the same for modulo, though