3,969,084

2² × 3 × 7 × 47251

3,969,084 factors as 2^2 × 3 × 7 × 47251. Its 24 positive divisors give a proper-divisor sum of 6,615,364, so this integer is abundant. The Collatz stopping time is 141 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 7 × 47251

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 10,584,448

Proper Divisor Sum 6,615,364

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3969071 ← → #3969137

Radix Representation

Decimal	3969084
Binary	1111001001000000111100 (22 bits)
Octal	0o17110074
Hexadecimal	0x3C903C

Divisor Catalog (24)

Collatz Trajectory (141 steps to reach 1)

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

3,969,084 1,984,542 992,271 2,976,814 1,488,407 4,465,222 2,232,611 6,697,834 3,348,917 10,046,752 5,023,376 2,511,688 1,255,844 627,922 313,961 941,884 470,942 235,471 706,414 353,207 1,059,622 529,811 1,589,434 794,717 2,384,152 1,192,076 596,038 298,019 894,058 447,029 1,341,088 670,544 335,272 167,636 83,818 41,909 125,728 62,864 31,432 15,716 7,858 3,929 11,788 5,894 2,947 8,842 4,421 13,264 6,632 3,316 1,658 829 2,488 1,244 622 311 934 467 1,402 701

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,969,083 Browse Full Index Next Integer #3,969,085 →