3,209,276

2² × 7 × 114617

3,209,276 factors as 2^2 × 7 × 114617. Its 12 positive divisors give a proper-divisor sum of 3,209,332, so this integer is abundant. The Collatz stopping time is 164 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 114617

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 6,418,608

Proper Divisor Sum 3,209,332

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #3209267 ← → #3209279

Radix Representation

Decimal	3209276
Binary	1100001111100000111100 (22 bits)
Octal	0o14174074
Hexadecimal	0x30F83C

Divisor Catalog (12)

1 2 4 7 14 28 114,617 229,234 458,468 802,319 1,604,638 3,209,276

Collatz Trajectory (164 steps to reach 1)

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

3,209,276 1,604,638 802,319 2,406,958 1,203,479 3,610,438 1,805,219 5,415,658 2,707,829 8,123,488 4,061,744 2,030,872 1,015,436 507,718 253,859 761,578 380,789 1,142,368 571,184 285,592 142,796 71,398 35,699 107,098 53,549 160,648 80,324 40,162 20,081 60,244 30,122 15,061 45,184 22,592 11,296 5,648 2,824 1,412 706 353 1,060 530 265 796 398 199 598 299 898 449 1,348 674 337 1,012 506 253 760 380 190 95

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,209,275 Browse Full Index Next Integer #3,209,277 →