9,606,884

2² × 7 × 293 × 1171

9,606,884 factors as 2^2 × 7 × 293 × 1171. Its 24 positive divisors give a proper-divisor sum of 9,688,924, so this integer is abundant. The Collatz stopping time is 119 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 293 × 1171

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 19,295,808

Proper Divisor Sum 9,688,924

Digit Sum / Digital Root 41 (Root: 5)

Adjacent Primes #9606811 ← → #9606889

Radix Representation

Decimal	9606884
Binary	100100101001011011100100 (24 bits)
Octal	0o44513344
Hexadecimal	0x9296E4

Divisor Catalog (24)

Collatz Trajectory (119 steps to reach 1)

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

9,606,884 4,803,442 2,401,721 7,205,164 3,602,582 1,801,291 5,403,874 2,701,937 8,105,812 4,052,906 2,026,453 6,079,360 3,039,680 1,519,840 759,920 379,960 189,980 94,990 47,495 142,486 71,243 213,730 106,865 320,596 160,298 80,149 240,448 120,224 60,112 30,056 15,028 7,514 3,757 11,272 5,636 2,818 1,409 4,228 2,114 1,057 3,172 1,586 793 2,380 1,190 595 1,786 893 2,680 1,340 670 335 1,006 503 1,510 755 2,266 1,133 3,400 1,700

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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