9,708,324

2² × 3 × 107 × 7561

9,708,324 factors as 2^2 × 3 × 107 × 7561. Its 24 positive divisors give a proper-divisor sum of 13,159,164, so this integer is abundant. The Collatz stopping time is 207 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 107 × 7561

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 22,867,488

Proper Divisor Sum 13,159,164

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9708317 ← → #9708329

Radix Representation

Decimal	9708324
Binary	100101000010001100100100 (24 bits)
Octal	0o45021444
Hexadecimal	0x942324

Divisor Catalog (24)

Collatz Trajectory (207 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

9,708,324 4,854,162 2,427,081 7,281,244 3,640,622 1,820,311 5,460,934 2,730,467 8,191,402 4,095,701 12,287,104 6,143,552 3,071,776 1,535,888 767,944 383,972 191,986 95,993 287,980 143,990 71,995 215,986 107,993 323,980 161,990 80,995 242,986 121,493 364,480 182,240 91,120 45,560 22,780 11,390 5,695 17,086 8,543 25,630 12,815 38,446 19,223 57,670 28,835 86,506 43,253 129,760 64,880 32,440 16,220 8,110 4,055 12,166 6,083 18,250 9,125 27,376 13,688 6,844 3,422 1,711

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,708,323 Browse Full Index Next Integer #9,708,325 →