3,978,330

2 × 3 × 5 × 132611

3,978,330 factors as 2 × 3 × 5 × 132611. Its 16 positive divisors give a proper-divisor sum of 5,569,734, so this integer is abundant. The Collatz stopping time is 141 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 132611

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,548,064

Proper Divisor Sum 5,569,734

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3978329 ← → #3978349

Radix Representation

Decimal	3978330
Binary	1111001011010001011010 (22 bits)
Octal	0o17132132
Hexadecimal	0x3CB45A

Divisor Catalog (16)

1 2 3 5 6 10 15 30 132,611 265,222 397,833 663,055 795,666 1,326,110 1,989,165 3,978,330

Collatz Trajectory (141 steps to reach 1)

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

3,978,330 1,989,165 5,967,496 2,983,748 1,491,874 745,937 2,237,812 1,118,906 559,453 1,678,360 839,180 419,590 209,795 629,386 314,693 944,080 472,040 236,020 118,010 59,005 177,016 88,508 44,254 22,127 66,382 33,191 99,574 49,787 149,362 74,681 224,044 112,022 56,011 168,034 84,017 252,052 126,026 63,013 189,040 94,520 47,260 23,630 11,815 35,446 17,723 53,170 26,585 79,756 39,878 19,939 59,818 29,909 89,728 44,864 22,432 11,216 5,608 2,804 1,402 701

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,978,329 Browse Full Index Next Integer #3,978,331 →