9,969,677

3061 × 3257

9,969,677 factors as 3061 × 3257. Its 4 positive divisors give a proper-divisor sum of 6,319, so this integer is deficient. The Collatz stopping time is 176 steps.

Prime Factor Structure

Factorization String 3061 × 3257

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 9,975,996

Proper Divisor Sum 6,319

Digit Sum / Digital Root 53 (Root: 8)

Adjacent Primes #9969653 ← → #9969689

Radix Representation

Decimal	9969677
Binary	100110000010000000001101 (24 bits)
Octal	0o46020015
Hexadecimal	0x98200D

Divisor Catalog (4)

1 3,061 3,257 9,969,677

Collatz Trajectory (176 steps to reach 1)

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

9,969,677 29,909,032 14,954,516 7,477,258 3,738,629 11,215,888 5,607,944 2,803,972 1,401,986 700,993 2,102,980 1,051,490 525,745 1,577,236 788,618 394,309 1,182,928 591,464 295,732 147,866 73,933 221,800 110,900 55,450 27,725 83,176 41,588 20,794 10,397 31,192 15,596 7,798 3,899 11,698 5,849 17,548 8,774 4,387 13,162 6,581 19,744 9,872 4,936 2,468 1,234 617 1,852 926 463 1,390 695 2,086 1,043 3,130 1,565 4,696 2,348 1,174 587 1,762

← Previous Integer #9,969,676 Browse Full Index Next Integer #9,969,678 →