Properties

Label 688747536.dq
Order \( 2^{4} \cdot 3^{16} \)
Exponent \( 2^{3} \cdot 3^{3} \)
Nilpotent no
Solvable yes
$\card{G^{\mathrm{ab}}}$ \( 2 \)
$\card{Z(G)}$ 3
$\card{\Aut(G)}$ \( 2^{5} \cdot 3^{17} \)
$\card{\mathrm{Out}(G)}$ \( 2 \cdot 3^{2} \)
Perm deg. $36$
Trans deg. $36$
Rank $2$

Related objects

Downloads

Learn more

Show commands: Gap / Magma / Oscar / SageMath

Copy content comment:Construction of abstract group
 
Copy content magma:G := PermutationGroup< 36 | (1,10,31,27,24,8,14,35,19)(2,12,33,25,23,7,15,34,21)(3,11,32,26,22,9,13,36,20)(4,28,18)(5,29,16)(6,30,17), (1,27)(2,25)(3,26)(4,35,29,24,16,12,5,34,30,23,17,11,6,36,28,22,18,10)(7,20,32,8,21,33,9,19,31) >;
 
Copy content gap:G := Group( (1,10,31,27,24,8,14,35,19)(2,12,33,25,23,7,15,34,21)(3,11,32,26,22,9,13,36,20)(4,28,18)(5,29,16)(6,30,17), (1,27)(2,25)(3,26)(4,35,29,24,16,12,5,34,30,23,17,11,6,36,28,22,18,10)(7,20,32,8,21,33,9,19,31) );
 
Copy content sage:G = PermutationGroup(['(1,10,31,27,24,8,14,35,19)(2,12,33,25,23,7,15,34,21)(3,11,32,26,22,9,13,36,20)(4,28,18)(5,29,16)(6,30,17)', '(1,27)(2,25)(3,26)(4,35,29,24,16,12,5,34,30,23,17,11,6,36,28,22,18,10)(7,20,32,8,21,33,9,19,31)'])
 
Copy content sage_gap:G = gap.new('Group( (1,10,31,27,24,8,14,35,19)(2,12,33,25,23,7,15,34,21)(3,11,32,26,22,9,13,36,20)(4,28,18)(5,29,16)(6,30,17), (1,27)(2,25)(3,26)(4,35,29,24,16,12,5,34,30,23,17,11,6,36,28,22,18,10)(7,20,32,8,21,33,9,19,31) )')
 
Copy content oscar:G = @permutation_group(36, (1,10,31,27,24,8,14,35,19)(2,12,33,25,23,7,15,34,21)(3,11,32,26,22,9,13,36,20)(4,28,18)(5,29,16)(6,30,17), (1,27)(2,25)(3,26)(4,35,29,24,16,12,5,34,30,23,17,11,6,36,28,22,18,10)(7,20,32,8,21,33,9,19,31))
 

Group information

Description:$C_3^8.(C_3^7.\GL(2,3))$
Order: \(688747536\)\(\medspace = 2^{4} \cdot 3^{16} \)
Copy content comment:Order of the group
 
Copy content magma:Order(G);
 
Copy content gap:Order(G);
 
Copy content sage:G.order()
 
Copy content sage_gap:G.Order()
 
Copy content oscar:order(G)
 
Exponent: \(216\)\(\medspace = 2^{3} \cdot 3^{3} \)
Copy content comment:Exponent of the group
 
Copy content magma:Exponent(G);
 
Copy content gap:Exponent(G);
 
Copy content sage:G.exponent()
 
Copy content sage_gap:G.Exponent()
 
Copy content oscar:exponent(G)
 
Automorphism group:Group of order \(4132485216\)\(\medspace = 2^{5} \cdot 3^{17} \)
Copy content comment:Automorphism group
 
Copy content gap:AutomorphismGroup(G);
 
Copy content magma:AutomorphismGroup(G);
 
Copy content sage:libgap(G).AutomorphismGroup()
 
Copy content sage_gap:G.AutomorphismGroup()
 
Copy content oscar:automorphism_group(G)
 
Composition factors:$C_2$ x 4, $C_3$ x 16
Copy content comment:Composition factors of the group
 
Copy content magma:CompositionFactors(G);
 
Copy content gap:CompositionSeries(G);
 
Copy content sage:G.composition_series()
 
Copy content sage_gap:G.CompositionSeries()
 
Copy content oscar:composition_series(G)
 
Derived length:$6$
Copy content comment:Derived length of the group
 
Copy content magma:DerivedLength(G);
 
Copy content gap:DerivedLength(G);
 
Copy content sage:libgap(G).DerivedLength()
 
Copy content sage_gap:G.DerivedLength()
 
Copy content oscar:derived_length(G)
 

This group is nonabelian and solvable. Whether it is monomial has not been computed.

Copy content comment:Determine if the group G is abelian
 
Copy content magma:IsAbelian(G);
 
Copy content gap:IsAbelian(G);
 
Copy content sage:G.is_abelian()
 
Copy content sage_gap:G.IsAbelian()
 
Copy content oscar:is_abelian(G)
 
Copy content comment:Determine if the group G is cyclic
 
Copy content magma:IsCyclic(G);
 
Copy content gap:IsCyclic(G);
 
Copy content sage:G.is_cyclic()
 
Copy content sage_gap:G.IsCyclic()
 
Copy content oscar:is_cyclic(G)
 
Copy content comment:Determine if the group G is nilpotent
 
Copy content magma:IsNilpotent(G);
 
Copy content gap:IsNilpotentGroup(G);
 
Copy content sage:G.is_nilpotent()
 
Copy content sage_gap:G.IsNilpotentGroup()
 
Copy content oscar:is_nilpotent(G)
 
Copy content comment:Determine if the group G is solvable
 
Copy content magma:IsSolvable(G);
 
Copy content gap:IsSolvableGroup(G);
 
Copy content sage:G.is_solvable()
 
Copy content sage_gap:G.IsSolvableGroup()
 
Copy content oscar:is_solvable(G)
 
Copy content comment:Determine if the group G is supersolvable
 
Copy content gap:IsSupersolvableGroup(G);
 
Copy content sage:G.is_supersolvable()
 
Copy content sage_gap:G.IsSupersolvableGroup()
 
Copy content oscar:is_supersolvable(G)
 
Copy content comment:Determine if the group G is simple
 
Copy content magma:IsSimple(G);
 
Copy content gap:IsSimpleGroup(G);
 
Copy content sage:G.is_simple()
 
Copy content sage_gap:G.IsSimpleGroup()
 
Copy content oscar:is_simple(G)
 

Group statistics

Copy content comment:Compute statistics for the group G
 
Copy content magma:// Magma code to output the first two rows of the group statistics table element_orders := [Order(g) : g in G]; orders := Set(element_orders); printf "Orders: %o\n", orders; printf "Elements: %o %o\n", [#[x : x in element_orders | x eq n] : n in orders], Order(G); cc_orders := [cc[1] : cc in ConjugacyClasses(G)]; printf "Conjugacy classes: %o %o\n", [#[x : x in cc_orders | x eq n] : n in orders], #cc_orders;
 
Copy content gap:# Gap code to output the first two rows of the group statistics table element_orders := List(Elements(G), g -> Order(g)); orders := Set(element_orders); Print("Orders: ", orders, "\n"); element_counts := List(orders, n -> Length(Filtered(element_orders, x -> x = n))); Print("Elements: ", element_counts, " ", Size(G), "\n"); cc_orders := List(ConjugacyClasses(G), cc -> Order(Representative(cc))); cc_counts := List(orders, n -> Length(Filtered(cc_orders, x -> x = n))); Print("Conjugacy classes: ", cc_counts, " ", Length(ConjugacyClasses(G)), "\n");
 
Copy content sage:# Sage code to output the first two rows of the group statistics table element_orders = [g.order() for g in G] orders = sorted(list(set(element_orders))) print("Orders:", orders) print("Elements:", [element_orders.count(n) for n in orders], G.order()) cc_orders = [cc[0].order() for cc in G.conjugacy_classes()] print("Conjugacy classes:", [cc_orders.count(n) for n in orders], len(cc_orders))
 
Copy content sage_gap:# Sage code (using the GAP interface) to output the first two rows of the group statistics table element_orders = [g.Order() for g in G.Elements()] orders = sorted(list(set(element_orders))) print("Orders:", orders) print("Elements:", [element_orders.count(n) for n in orders], G.Order()) cc_orders = [cc.Representative().Order() for cc in G.ConjugacyClasses()] print("Conjugacy classes:", [cc_orders.count(n) for n in orders], len(cc_orders))
 
Copy content oscar:# Oscar code to output the first two rows of the group statistics table element_orders = [order(g) for g in elements(G)] orders = sort(unique(element_orders)) println("Orders: ", orders) element_counts = [count(==(n), element_orders) for n in orders] println("Elements: ", element_counts, " ", order(G)) ccs = conjugacy_classes(G) cc_orders = [order(representative(cc)) for cc in ccs] cc_counts = [count(==(n), cc_orders) for n in orders] println("Conjugacy classes: ", cc_counts, " ", length(ccs))
 

Order 1 2 3 4 6 8 9 12 18 24 27
Elements 1 15309 2854034 3188646 80232282 57395628 75267792 82904796 221079456 114791256 51018336 688747536
Conjugacy classes   1 2 406 1 541 2 533 14 204 4 10 1718
Divisions 1 2 229 1 284 1 270 9 102 1 5 905
Autjugacy classes 1 2 122 1 134 2 126 5 40 2 3 438

Minimal presentations

Permutation degree:$36$
Transitive degree:$36$
Rank: $2$
Inequivalent generating pairs: not computed

Minimal degrees of faithful linear representations

Over $\mathbb{C}$ Over $\mathbb{R}$ Over $\mathbb{Q}$
Irreducible 12 not computed not computed
Arbitrary not computed not computed not computed

Constructions

Show commands: Gap / Magma / Oscar / SageMath


Presentation: ${\langle a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p \mid d^{12}=e^{3}= \!\cdots\! \rangle}$ Copy content Toggle raw display
Copy content comment:Define the group with the given generators and relations
 
Copy content magma:G := PCGroup([20, 2, 3, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 11208460800, 5017283201, 13528056501, 22375386002, 12960155362, 5859196602, 21901240803, 10479164423, 7255622283, 223, 5427453604, 26111048424, 7508944444, 284, 76039032965, 32286435865, 6124768365, 77381082246, 45348740666, 15451615246, 2640635826, 2199121766, 55354890247, 32309740827, 14539641647, 5685083587, 3261260247, 1573591787, 8748607, 85844387528, 53684523388, 9795556848, 1793700788, 2743107208, 999945108, 782218748, 63598648, 14748, 42862051209, 37814952029, 8833488049, 8089526469, 2646406889, 977605309, 96670929, 41749349, 11635969, 3353589, 111344777290, 10175790270, 14762230610, 11120107750, 390899610, 11553450, 518930, 642370, 52844958731, 24485385631, 9162138291, 1519542791, 5835469051, 2451947871, 287362211, 45450871, 1713791, 236371, 951, 1842328832, 122821972, 982575432, 99532245133, 49881417633, 285398453, 13247841673, 6094396653, 3805817513, 645631693, 113831073, 68040173, 1406353, 75813, 1182113, 2793, 100311638414, 91207742434, 13369464054, 9446868074, 6616315894, 4081598214, 693060434, 126335854, 73702074, 243194, 97414, 1174734, 60574, 1194, 14511882255, 16796195, 5598775, 377913675, 8673117136, 499685796, 2575761176, 3061100177, 8673117157, 88179917, 158366793618, 79726356038, 30079201018, 17014199118, 2784051098, 97234178, 23269858, 14128218, 1077538, 143918, 48178, 113374080019, 121058323239, 13716864059, 19990929679, 8030664099, 225698559, 25660999, 2786639]); a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p := Explode([G.1, G.2, G.3, G.4, G.7, G.8, G.9, G.10, G.11, G.12, G.14, G.15, G.17, G.18, G.19, G.20]); AssignNames(~G, ["a", "b", "c", "d", "d2", "d4", "e", "f", "g", "h", "i", "j", "j3", "k", "l", "l3", "m", "n", "o", "p"]);
 
Copy content gap:G := PcGroupCode(310968807663542056970170005358649111721584907597583902929848073870107536972642072545201512681103654137300721419635602169392028581261785913980815618058143928529719862149378489828941003485341475243677717014513759417969497912736844451104626925876134943529100853449779367536184398594650965271000979807655406841807591399107679242383615329920329678594718088798504053088351953955553623685797110060127342211858588226773843767585294290446861370474594757579785730788647142643774085120176451256242578640146565395453491728658215551760358502393045423902074880536724370699675717464583937564651187083386314816600673962038607372982565657717048797980658712525015919751457493743723575318229619232662570859637916982564532861321185646637720363749823830174589604055434139905298126611624095798184360401528581859861336989127117296831101219920365184162941702621096840761010621139182053832065690813129796367950125747701093719734366756441615999785404616914501618753059699442658710848667919986315633584137304550445635347231723095813733554004276785248895735903182483386127316032007533480679157371229580131153590176519388350026297675675672183357497699056418676164081334475556165916642118302017464384651263,688747536); a := G.1; b := G.2; c := G.3; d := G.4; e := G.7; f := G.8; g := G.9; h := G.10; i := G.11; j := G.12; k := G.14; l := G.15; m := G.17; n := G.18; o := G.19; p := G.20;
 
Copy content sage:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(310968807663542056970170005358649111721584907597583902929848073870107536972642072545201512681103654137300721419635602169392028581261785913980815618058143928529719862149378489828941003485341475243677717014513759417969497912736844451104626925876134943529100853449779367536184398594650965271000979807655406841807591399107679242383615329920329678594718088798504053088351953955553623685797110060127342211858588226773843767585294290446861370474594757579785730788647142643774085120176451256242578640146565395453491728658215551760358502393045423902074880536724370699675717464583937564651187083386314816600673962038607372982565657717048797980658712525015919751457493743723575318229619232662570859637916982564532861321185646637720363749823830174589604055434139905298126611624095798184360401528581859861336989127117296831101219920365184162941702621096840761010621139182053832065690813129796367950125747701093719734366756441615999785404616914501618753059699442658710848667919986315633584137304550445635347231723095813733554004276785248895735903182483386127316032007533480679157371229580131153590176519388350026297675675672183357497699056418676164081334475556165916642118302017464384651263,688747536)'); a = G.1; b = G.2; c = G.3; d = G.4; e = G.7; f = G.8; g = G.9; h = G.10; i = G.11; j = G.12; k = G.14; l = G.15; m = G.17; n = G.18; o = G.19; p = G.20;
 
Copy content sage_gap:# This uses Sage's interface to GAP, as Sage (currently) has no native support for PC groups G = gap.new('PcGroupCode(310968807663542056970170005358649111721584907597583902929848073870107536972642072545201512681103654137300721419635602169392028581261785913980815618058143928529719862149378489828941003485341475243677717014513759417969497912736844451104626925876134943529100853449779367536184398594650965271000979807655406841807591399107679242383615329920329678594718088798504053088351953955553623685797110060127342211858588226773843767585294290446861370474594757579785730788647142643774085120176451256242578640146565395453491728658215551760358502393045423902074880536724370699675717464583937564651187083386314816600673962038607372982565657717048797980658712525015919751457493743723575318229619232662570859637916982564532861321185646637720363749823830174589604055434139905298126611624095798184360401528581859861336989127117296831101219920365184162941702621096840761010621139182053832065690813129796367950125747701093719734366756441615999785404616914501618753059699442658710848667919986315633584137304550445635347231723095813733554004276785248895735903182483386127316032007533480679157371229580131153590176519388350026297675675672183357497699056418676164081334475556165916642118302017464384651263,688747536)'); a = G.1; b = G.2; c = G.3; d = G.4; e = G.7; f = G.8; g = G.9; h = G.10; i = G.11; j = G.12; k = G.14; l = G.15; m = G.17; n = G.18; o = G.19; p = G.20;
 
Permutation group:Degree $36$ $\langle(1,10,31,27,24,8,14,35,19)(2,12,33,25,23,7,15,34,21)(3,11,32,26,22,9,13,36,20) \!\cdots\! \rangle$ Copy content Toggle raw display
Copy content comment:Define the group as a permutation group
 
Copy content magma:G := PermutationGroup< 36 | (1,10,31,27,24,8,14,35,19)(2,12,33,25,23,7,15,34,21)(3,11,32,26,22,9,13,36,20)(4,28,18)(5,29,16)(6,30,17), (1,27)(2,25)(3,26)(4,35,29,24,16,12,5,34,30,23,17,11,6,36,28,22,18,10)(7,20,32,8,21,33,9,19,31) >;
 
Copy content gap:G := Group( (1,10,31,27,24,8,14,35,19)(2,12,33,25,23,7,15,34,21)(3,11,32,26,22,9,13,36,20)(4,28,18)(5,29,16)(6,30,17), (1,27)(2,25)(3,26)(4,35,29,24,16,12,5,34,30,23,17,11,6,36,28,22,18,10)(7,20,32,8,21,33,9,19,31) );
 
Copy content sage:G = PermutationGroup(['(1,10,31,27,24,8,14,35,19)(2,12,33,25,23,7,15,34,21)(3,11,32,26,22,9,13,36,20)(4,28,18)(5,29,16)(6,30,17)', '(1,27)(2,25)(3,26)(4,35,29,24,16,12,5,34,30,23,17,11,6,36,28,22,18,10)(7,20,32,8,21,33,9,19,31)'])
 
Copy content sage_gap:G = gap.new('Group( (1,10,31,27,24,8,14,35,19)(2,12,33,25,23,7,15,34,21)(3,11,32,26,22,9,13,36,20)(4,28,18)(5,29,16)(6,30,17), (1,27)(2,25)(3,26)(4,35,29,24,16,12,5,34,30,23,17,11,6,36,28,22,18,10)(7,20,32,8,21,33,9,19,31) )')
 
Copy content oscar:G = @permutation_group(36, (1,10,31,27,24,8,14,35,19)(2,12,33,25,23,7,15,34,21)(3,11,32,26,22,9,13,36,20)(4,28,18)(5,29,16)(6,30,17), (1,27)(2,25)(3,26)(4,35,29,24,16,12,5,34,30,23,17,11,6,36,28,22,18,10)(7,20,32,8,21,33,9,19,31))
 
Transitive group: 36T90047 more information
Copy content magma:G := TransitiveGroup(36, 90047);
 
Copy content gap:G := TransitiveGroup(36, 90047);
 
Copy content sage:G = TransitiveGroup(36, 90047)
 
Copy content sage_gap:G = libgap.TransitiveGroup(36, 90047)
 
Copy content oscar:G = transitive_group(36, 90047)
 
Direct product: not computed
Semidirect product: not computed
Trans. wreath product: not isomorphic to a non-trivial transitive wreath product
Possibly split product: $C_3^8$ . $(C_3^7.\GL(2,3))$ $(C_3^{11}.C_3^4)$ . $\GL(2,3)$ $C_3^{11}$ . $(C_3^4:\GL(2,3))$ $C_3^6$ . $(C_3^6.C_3^3.Q_8.S_3)$ all 14

Elements of the group are displayed as permutations of degree 36.

Homology

Abelianization: $C_{2} $
Copy content comment:The abelianization of the group
 
Copy content magma:quo< G | CommutatorSubgroup(G) >;
 
Copy content gap:FactorGroup(G, DerivedSubgroup(G));
 
Copy content sage:G.quotient(G.commutator())
 
Copy content sage_gap:G.FactorGroup(G.DerivedSubgroup())
 
Copy content oscar:quo(G, derived_subgroup(G)[1])
 
Schur multiplier: $C_1$
Copy content comment:The Schur multiplier of the group
 
Copy content gap:AbelianInvariantsMultiplier(G);
 
Copy content sage:G.homology(2)
 
Copy content sage_gap:G.AbelianInvariantsMultiplier()
 
Commutator length: $2$
Copy content comment:The commutator length of the group
 
Copy content gap:CommutatorLength(G);
 
Copy content sage_gap:G.CommutatorLength()
 

Subgroups

Copy content comment:List of subgroups of the group
 
Copy content magma:Subgroups(G);
 
Copy content gap:AllSubgroups(G);
 
Copy content sage:G.subgroups()
 
Copy content sage_gap:G.AllSubgroups()
 
Copy content oscar:subgroups(G)
 

There are 16 normal subgroups, and all normal subgroups are characteristic.

Characteristic subgroups are shown in this color.

Special subgroups

Center: a subgroup isomorphic to $C_3$
Copy content comment:Center of the group
 
Copy content magma:Center(G);
 
Copy content gap:Center(G);
 
Copy content sage:G.center()
 
Copy content sage_gap:G.Center()
 
Copy content oscar:center(G)
 
Commutator: a subgroup isomorphic to $C_3^8.(C_3^7.\SL(2,3))$
Copy content comment:Commutator subgroup of the group G
 
Copy content magma:CommutatorSubgroup(G);
 
Copy content gap:DerivedSubgroup(G);
 
Copy content sage:G.commutator()
 
Copy content sage_gap:G.DerivedSubgroup()
 
Copy content oscar:derived_subgroup(G)
 
Frattini: not computed
Copy content comment:Frattini subgroup of the group G
 
Copy content magma:FrattiniSubgroup(G);
 
Copy content gap:FrattiniSubgroup(G);
 
Copy content sage:G.frattini_subgroup()
 
Copy content sage_gap:G.FrattiniSubgroup()
 
Copy content oscar:frattini_subgroup(G)
 
Fitting: not computed
Copy content comment:Fitting subgroup of the group G
 
Copy content magma:FittingSubgroup(G);
 
Copy content gap:FittingSubgroup(G);
 
Copy content sage:G.fitting_subgroup()
 
Copy content sage_gap:G.FittingSubgroup()
 
Copy content oscar:fitting_subgroup(G)
 
Radical: not computed
Copy content comment:Radical of the group G
 
Copy content magma:Radical(G);
 
Copy content gap:SolvableRadical(G);
 
Copy content sage_gap:G.SolvableRadical()
 
Copy content oscar:solvable_radical(G)
 
Socle: not computed
Copy content comment:Socle of the group G
 
Copy content magma:Socle(G);
 
Copy content gap:Socle(G);
 
Copy content sage:G.socle()
 
Copy content sage_gap:G.Socle()
 
Copy content oscar:socle(G)
 
3-Sylow subgroup: $P_{ 3 } \simeq$ $C_3^9.C_3^5.C_3^2$

Subgroup diagram and profile

Series

Derived series not computed
Copy content comment:Derived series of the group G
 
Copy content magma:DerivedSeries(G);
 
Copy content gap:DerivedSeriesOfGroup(G);
 
Copy content sage:G.derived_series()
 
Copy content sage_gap:G.DerivedSeriesOfGroup()
 
Copy content oscar:derived_series(G)
 
Chief series not computed
Copy content comment:Chief series of the group G
 
Copy content magma:ChiefSeries(G);
 
Copy content gap:ChiefSeries(G);
 
Copy content sage:libgap(G).ChiefSeries()
 
Copy content sage_gap:G.ChiefSeries()
 
Copy content oscar:chief_series(G)
 
Lower central series not computed
Copy content comment:The lower central series of the group G
 
Copy content magma:LowerCentralSeries(G);
 
Copy content gap:LowerCentralSeriesOfGroup(G);
 
Copy content sage:G.lower_central_series()
 
Copy content sage_gap:G.LowerCentralSeriesOfGroup()
 
Copy content oscar:lower_central_series(G)
 
Upper central series not computed
Copy content comment:The upper central series of the group G
 
Copy content magma:UpperCentralSeries(G);
 
Copy content gap:UpperCentralSeriesOfGroup(G);
 
Copy content sage:G.upper_central_series()
 
Copy content sage_gap:G.UpperCentralSeriesOfGroup()
 
Copy content oscar:upper_central_series(G)
 

Supergroups

This group is a maximal subgroup of 3 larger groups in the database.

This group is a maximal quotient of 0 larger groups in the database.

Character theory

Copy content comment:Character table
 
Copy content magma:CharacterTable(G); // Output not guaranteed to exactly match the LMFDB table
 
Copy content gap:CharacterTable(G); # Output not guaranteed to exactly match the LMFDB table
 
Copy content sage:G.character_table() # Output not guaranteed to exactly match the LMFDB table
 
Copy content sage_gap:G.CharacterTable() # Output not guaranteed to exactly match the LMFDB table
 
Copy content oscar:character_table(G) # Output not guaranteed to exactly match the LMFDB table
 

Complex character table

The $1718 \times 1718$ character table is not available for this group.

Rational character table

The $905 \times 905$ rational character table is not available for this group.