While making a translation to a YouTube video (translations can only be in Unicode, no other markup is possible as far as I know of), I stumbled across the concentration of H+ in orange juice. It is supposed to be one times ten to the negative 3.5 molar.
I'd like to write it down as "1·10-3,5 M" (mind the comma, it is translated to dutch). The problem is that I can not find a superscript comma or even a superscript period between all 120,520 unicode graphical characters.
Does someone have an idea on how to solve this?
There exists two, but the first is more useful for your use case.
U+1d112 Musical Symbol Breath Mark
As far as I know there is no unicode for superscript comma however you can use (U+22C5) as dot seperator.
The Greek Ano Teleia (U+0387) looks decent with some fonts:
Here's an example of what it would look like in your particular case (all of the superscript characters are Unicode characters):
In this example it looks really good, but in other fonts, the character hovers closer to the middle (vertically) of the superscript characters.
Even in fonts that it does look good with, if you increase the font-size enough, it becomes apparent that the dot is not quite where it needs to be.
I really wish that an official superscript/subscript decimal point would be added to the Unicode standard as all of the characters that can be used to substitute these characters are font (and sometimes size) dependent, so there's no guarantee that they'll look good in all use-cases.
The Unicode superscript (and subscript) code points are for backwards compatibility with older character sets and are essentially deprecated. They are not intended to be complete, or be used to format text. If you need to use superscript characters, the recommended (and most complete/compatible) approach is to use a markup language.
If no markup language is available, then you're simply out of luck. Hacking in other character that look similar may appear to be a usable workaround, but damages any semantic value to the text – for example,
U+22C5
may be mechanically parsed as a multiplication of the adjacent numbers.