Computing prime numbers in hieroglyphs

from math import sqrt, ceil

𓀀 = ['𓏺', '𓎆', '𓍢', '𓆼', '𓂭']

def 𓀐(𓀰):
    𓀠 = 0
    𓁀 = ''
    while 𓀰 > 0 and 𓀠 < 5:
        if 𓀰 % 10 > 0:
            𓁀 = chr((𓀰 % 10) - 1 + ord(𓀀[𓀠])) + '  ' + 𓁀
        𓀠 += 1
        𓀰 //= 10
    print(𓁀, "\n")

𓀐(2)
for 𓁐 in range(3, 100, 2):
    𓁰 = True
    for 𓁠 in range(2, ceil(sqrt(𓁐))):
        if 𓁐 % 𓁠 == 0:
            𓁰 = False
            break
    if 𓁰:
        𓀐(𓁐)