U+2119 was added to Unicode in version 1.1 (1993). It belongs to the block Letterlike Symbols in the Basic Multilingual Plane.

This character is a Uppercase Letter and is commonly used, that is, in no specific script.

The glyph is a Font composition of the glyphs P. It has a Neutral East Asian Width. In bidirectional context it acts as Left To Right and is not mirrored. The glyph can, under circumstances, be confused with 33 other glyphs. In text U+2119 behaves as Alphabetic regarding line breaks. It has type Upper for sentence and ALetter for word breaks. The Grapheme Cluster Break is Any.

The Wikipedia has the following information about this codepoint:

A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is called a composite number. For example, 5 is prime because 1 and 5 are its only positive integer factors, whereas 6 is composite because it has the divisors 2 and 3 in addition to 1 and 6. The fundamental theorem of arithmetic establishes the central role of primes in number theory: any integer greater than 1 can be expressed as a product of primes that is unique up to ordering. The uniqueness in this theorem requires excluding 1 as a prime because one can include arbitrarily many instances of 1 in any factorization, e.g., 3, 1 · 3, 1 · 1 · 3, etc. are all valid factorizations of 3.

The property of being prime (or not) is called primality. A simple but slow method of verifying the primality of a given number n is known as trial division. It consists of testing whether n is a multiple of any integer between 2 and . Algorithms much more efficient than trial division have been devised to test the primality of large numbers. Particularly fast methods are available for numbers of special forms, such as Mersenne numbers. As of April 2014, the largest known prime number has 17,425,170 decimal digits.

There are infinitely many primes, as demonstrated by Euclid around 300 BC. There is no known useful formula that sets apart all of the prime numbers from composites. However, the distribution of primes, that is to say, the statistical behaviour of primes in the large, can be modelled. The first result in that direction is the prime number theorem, proven at the end of the 19th century, which says that the probability that a given, randomly chosen number n is prime is inversely proportional to its number of digits, or to the logarithm of n.

Many questions regarding prime numbers remain open, such as Goldbach's conjecture (that every even integer greater than 2 can be expressed as the sum of two primes), and the twin prime conjecture (that there are infinitely many pairs of primes whose difference is 2). Such questions spurred the development of various branches of number theory, focusing on analytic or algebraic aspects of numbers. Primes are used in several routines in information technology, such as public-key cryptography, which makes use of properties such as the difficulty of factoring large numbers into their prime factors. Prime numbers give rise to various generalizations in other mathematical domains, mainly algebra, such as prime elements and prime ideals.


System Representation
UTF-8 E2 84 99
UTF-16 21 19
UTF-32 00 00 21 19
URL-Quoted %E2%84%99
HTML-Escape ℙ
Wrong windows-1252 Mojibake ℙ
HTML-Escape ℙ
HTML-Escape ℙ
LaTeX \mathbb{P}

Related Characters


  • P
  • P
  • Ƥ
  • Ρ
  • Р
  • Ꮲ
  • ᑭ
  • ᑶ
  • ᒆ
  • ᕿ
  • ℙ
  • Ⲣ
  • ꓑ
  • P
  • 𐊕
  • 𝐏
  • 𝑃
  • 𝑷
  • 𝒫
  • 𝓟
  • 𝔓
  • 𝕻
  • 𝖯
  • 𝗣
  • 𝘗
  • 𝙋
  • 𝙿
  • 𝚸
  • 𝛲
  • 𝜬
  • 𝝦
  • 𝞠
  • 🄟


Complete Record

Property Value
Age (age) 1.1
Unicode 1 Name (na1) DOUBLE-STRUCK P
Block (blk) Letterlike_Symbols
General Category (gc) Uppercase Letter
Script (sc) Common
Bidirectional Category (bc) Left To Right
Combining Class (ccc) Not Reordered
Decomposition Type (dt) Font
Decomposition Mapping (dm) P
Lowercase (Lower)
Simple Lowercase Mapping (slc) ℙ
Lowercase Mapping (lc) ℙ
Uppercase (Upper)
Simple Uppercase Mapping (suc) ℙ
Uppercase Mapping (uc) ℙ
Simple Titlecase Mapping (stc) ℙ
Titlecase Mapping (tc) ℙ
Case Folding (cf) ℙ
ASCII Hex Digit (AHex)
Alphabetic (Alpha)
Bidi Control (Bidi_C)
Bidi Mirrored (Bidi_M)
Bidi Paired Bracket (bpb) ℙ
Bidi Paired Bracket Type (bpt) None
Cased (Cased)
Composition Exclusion (CE)
Case Ignorable (CI)
Full Composition Exclusion (Comp_Ex)
Changes When Casefolded (CWCF)
Changes When Casemapped (CWCM)
Changes When NFKC Casefolded (CWKCF)
Changes When Lowercased (CWL)
Changes When Titlecased (CWT)
Changes When Uppercased (CWU)
Dash (Dash)
Deprecated (Dep)
Default Ignorable Code Point (DI)
Diacritic (Dia)
East Asian Width (ea) Neutral
Extender (Ext)
FC NFKC Closure (FC_NFKC) p
Grapheme Cluster Break (GCB) Any
Grapheme Base (Gr_Base)
Grapheme Extend (Gr_Ext)
Hex Digit (Hex)
Hangul Syllable Type (hst) Not Applicable
Hyphen (Hyphen)
ID Continue (IDC)
Ideographic (Ideo)
ID Start (IDS)
IDS Binary Operator (IDSB)
IDS Trinary Operator and (IDST)
Indic Positional Category (InPC) NA
Indic Syllabic Category (InSC) Other
ISO 10646 Comment (isc)
Joining Group (jg) No_Joining_Group
Join Control (Join_C)
Jamo Short Name (JSN)
Joining Type (jt) Non Joining
Line Break (lb) Alphabetic
Logical Order Exception (LOE)
Math (Math)
Noncharacter Code Point (NChar)
NFC Quick Check (NFC_QC) Yes
NFD Quick Check (NFD_QC) Yes
NFKC Casefold (NFKC_CF) p
NFKC Quick Check (NFKC_QC) No
NFKD Quick Check (NFKD_QC) No
Numeric Type (nt) None
Numeric Value (nv) NaN
Other Alphabetic (OAlpha)
Other Default Ignorable Code Point (ODI)
Other Grapheme Extend (OGr_Ext)
Other ID Continue (OIDC)
Other ID Start (OIDS)
Other Lowercase (OLower)
Other Math (OMath)
Other Uppercase (OUpper)
Pattern Syntax (Pat_Syn)
Pattern White Space (Pat_WS)
Quotation Mark (QMark)
Radical (Radical)
Sentence Break (SB) Upper
Simple Case Folding (scf) ℙ
Script Extension (scx) Common
Soft Dotted (SD)
STerm (STerm)
Terminal Punctuation (Term)
Unified Ideograph (UIdeo)
Variation Selector (VS)
Word Break (WB) ALetter
White Space (WSpace)
XID Continue (XIDC)
XID Start (XIDS)
Expands On NFC (XO_NFC)
Expands On NFD (XO_NFD)
Expands On NFKC (XO_NFKC)
Expands On NFKD (XO_NFKD)