3,974,730

2 × 3 × 5 × 132491

3,974,730 factors as 2 × 3 × 5 × 132491. Its 16 positive divisors give a proper-divisor sum of 5,564,694, so this integer is abundant. The Collatz stopping time is 66 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 132491

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,539,424

Proper Divisor Sum 5,564,694

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3974723 ← → #3974741

Radix Representation

Decimal	3974730
Binary	1111001010011001001010 (22 bits)
Octal	0o17123112
Hexadecimal	0x3CA64A

Divisor Catalog (16)

1 2 3 5 6 10 15 30 132,491 264,982 397,473 662,455 794,946 1,324,910 1,987,365 3,974,730

Collatz Trajectory (66 steps to reach 1)

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

3,974,730 1,987,365 5,962,096 2,981,048 1,490,524 745,262 372,631 1,117,894 558,947 1,676,842 838,421 2,515,264 1,257,632 628,816 314,408 157,204 78,602 39,301 117,904 58,952 29,476 14,738 7,369 22,108 11,054 5,527 16,582 8,291 24,874 12,437 37,312 18,656 9,328 4,664 2,332 1,166 583 1,750 875 2,626 1,313 3,940 1,970 985 2,956 1,478 739 2,218 1,109 3,328 1,664 832 416 208 104 52 26 13 40 20

← Previous Integer #3,974,729 Browse Full Index Next Integer #3,974,731 →