9,704,884

2² × 7 × 307 × 1129

9,704,884 factors as 2^2 × 7 × 307 × 1129. Its 24 positive divisors give a proper-divisor sum of 9,785,356, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 307 × 1129

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 19,490,240

Proper Divisor Sum 9,785,356

Digit Sum / Digital Root 40 (Root: 4)

Adjacent Primes #9704867 ← → #9704887

Radix Representation

Decimal	9704884
Binary	100101000001010110110100 (24 bits)
Octal	0o45012664
Hexadecimal	0x9415B4

Divisor Catalog (24)

Collatz Trajectory (101 steps to reach 1)

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

9,704,884 4,852,442 2,426,221 7,278,664 3,639,332 1,819,666 909,833 2,729,500 1,364,750 682,375 2,047,126 1,023,563 3,070,690 1,535,345 4,606,036 2,303,018 1,151,509 3,454,528 1,727,264 863,632 431,816 215,908 107,954 53,977 161,932 80,966 40,483 121,450 60,725 182,176 91,088 45,544 22,772 11,386 5,693 17,080 8,540 4,270 2,135 6,406 3,203 9,610 4,805 14,416 7,208 3,604 1,802 901 2,704 1,352 676 338 169 508 254 127 382 191 574 287

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,704,883 Browse Full Index Next Integer #9,704,885 →