Finite Group Databasebeta

#72216537

order2048
nilpotency class5
automorphism?
homologyAbelianization (H1) = C2×C4×C8 · Schur multiplier (H2) = C23

Aliases

No aliases for this group.

Subgroups

subgroupG/H
centerC2×C8#2140
commutatorC2×C16C2×C4×C8
Frattini, cosocleC2×C8×C16C23
socleC22#122454
prime radicalC2×#508C2×C8
LCSG ▷ C2×C16 ▷ C8 ▷ C4 ▷ C2 ▷ C1
UCSC1 ◁ C2×C8 ◁ C22×C16 ◁ C4×#346 ◁ C8×#346 ◁ G
LECSG ▷ C2×C8×C16 ▷ C4×C8 ▷ C2×C4 ▷ C2 ▷ C1

935 conjugacy classes of subgroups.

Full subgroup data →

Presentation

Polycyclic presentation:

2^11|b^2=d,c^2=f,d^2=g,e^2=h,f^2=i,g^2=i,h^2=j,j^2=k,b^a=be,c^a=chj,c^b=ci,d^a=dh,e^a=ehjk,e^c=ek,f^a=fjk,g^a=gj,h^a=hjk,i^a=ik,j^a=jk

Conjugacy classes & character table

296 conjugacy classes — view the full character table.

Relationships

maximal subgroup of#72216556, #72225162, #72225219, …
maximal normal subgroup of#72216556, #72225162, #72225219, …
maximal quotient of#72227028

GAP

Past the SmallGroups library coverage — no SmallGroups id. Construct it from its polycyclic presentation:

gap> F := FreeGroup(IsSyllableWordsFamily, "a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]);;
gap> SetPower(coll, 2, F.4);;
gap> SetPower(coll, 3, F.6);;
gap> SetPower(coll, 4, F.7);;
gap> SetPower(coll, 5, F.8);;
gap> SetPower(coll, 6, F.9);;
gap> SetPower(coll, 7, F.9);;
gap> SetPower(coll, 8, F.10);;
gap> SetPower(coll, 10, F.11);;
gap> SetConjugate(coll, 2, 1, F.2*F.5);;
gap> SetConjugate(coll, 3, 1, F.3*F.8*F.10);;
gap> SetConjugate(coll, 3, 2, F.3*F.9);;
gap> SetConjugate(coll, 4, 1, F.4*F.8);;
gap> SetConjugate(coll, 5, 1, F.5*F.8*F.10*F.11);;
gap> SetConjugate(coll, 5, 3, F.5*F.11);;
gap> SetConjugate(coll, 6, 1, F.6*F.10*F.11);;
gap> SetConjugate(coll, 7, 1, F.7*F.10);;
gap> SetConjugate(coll, 8, 1, F.8*F.10*F.11);;
gap> SetConjugate(coll, 9, 1, F.9*F.11);;
gap> SetConjugate(coll, 10, 1, F.10*F.11);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);