| order | 22560 |
| automorphism | Aut(G) order 33208320 |
| homology | Abelianization (H1) = C22 · Schur multiplier (H2) = C1 |
| dicyclic | Dic5640 |
| Hall | C3×C5×C47 ⋊ Q32 |
| Hall | C5×C47 ⋊ Dic24 |
| Hall | C3×C47 ⋊ Dic40 |
| Sylow | C47 ⋊ Dic120 |
| Hall | C3×C5 ⋊ Dic376 |
| Sylow | C5 ⋊ Dic1128 |
| Sylow | C3 ⋊ Dic1880 |
96 conjugacy classes of subgroups.
| minimal degree | μ(G) = 87 |
| transitive degree | μt(G) = 22560 |
A minimal faithful permutation representation — 2 generators on 87 points:
(1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16)(17,32,31,30,29,28,27,26,25,24,23,22,21,20,19,18)(33,34,35)(36,37,38,39,40)(41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87);(1,17,9,25)(2,18,10,26)(3,19,11,27)(4,20,12,28)(5,21,13,29)(6,22,14,30)(7,23,15,31)(8,24,16,32)(34,35)(37,40)(38,39)(42,87)(43,86)(44,85)(45,84)(46,83)(47,82)(48,81)(49,80)(50,79)(51,78)(52,77)(53,76)(54,75)(55,74)(56,73)(57,72)(58,71)(59,70)(60,69)(61,68)(62,67)(63,66)(64,65)Polycyclic presentation:
2^5,3,5,47|a^2=e,b^2=cd,c^2=de,d^2=e,b^a=bc,c^a=cd,d^a=de,f^a=f^2,g^a=g^4,h^a=h^465643 conjugacy classes. The character table is too large to display.
| maximal subgroup of | Dic11280 |
| maximal normal subgroup of | Dic11280 |
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");;
gap> coll := SingleCollector(F, [2, 2, 2, 2, 2, 3, 5, 47]);;
gap> SetPower(coll, 1, F.5);;
gap> SetPower(coll, 2, F.3*F.4);;
gap> SetPower(coll, 3, F.4*F.5);;
gap> SetPower(coll, 4, F.5);;
gap> SetConjugate(coll, 2, 1, F.2*F.3);;
gap> SetConjugate(coll, 3, 1, F.3*F.4);;
gap> SetConjugate(coll, 4, 1, F.4*F.5);;
gap> SetConjugate(coll, 6, 1, F.6^2);;
gap> SetConjugate(coll, 7, 1, F.7^4);;
gap> SetConjugate(coll, 8, 1, F.8^46);;
gap> UpdatePolycyclicCollector(coll);;
gap> G := GroupByRws(coll);