9,257,604

2² × 3 × 61 × 12647

9,257,604 factors as 2^2 × 3 × 61 × 12647. Its 24 positive divisors give a proper-divisor sum of 12,699,324, so this integer is abundant. The Collatz stopping time is 194 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 61 × 12647

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 21,956,928

Proper Divisor Sum 12,699,324

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9257603 ← → #9257627

Radix Representation

Decimal	9257604
Binary	100011010100001010000100 (24 bits)
Octal	0o43241204
Hexadecimal	0x8D4284

Divisor Catalog (24)

1 2 3 4 6 12 61 122 183 244 366 732 12,647 25,294 37,941 50,588 75,882 151,764 771,467 1,542,934 2,314,401 3,085,868 4,628,802 9,257,604

Collatz Trajectory (194 steps to reach 1)

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

9,257,604 4,628,802 2,314,401 6,943,204 3,471,602 1,735,801 5,207,404 2,603,702 1,301,851 3,905,554 1,952,777 5,858,332 2,929,166 1,464,583 4,393,750 2,196,875 6,590,626 3,295,313 9,885,940 4,942,970 2,471,485 7,414,456 3,707,228 1,853,614 926,807 2,780,422 1,390,211 4,170,634 2,085,317 6,255,952 3,127,976 1,563,988 781,994 390,997 1,172,992 586,496 293,248 146,624 73,312 36,656 18,328 9,164 4,582 2,291 6,874 3,437 10,312 5,156 2,578 1,289 3,868 1,934 967 2,902 1,451 4,354 2,177 6,532 3,266 1,633

← Previous Integer #9,257,603 Browse Full Index Next Integer #9,257,605 →