3,970,482

2 × 3 × 569 × 1163

3,970,482 factors as 2 × 3 × 569 × 1163. Its 16 positive divisors give a proper-divisor sum of 3,991,278, so this integer is abundant. The Collatz stopping time is 185 steps.

Prime Factor Structure

Factorization String 2 × 3 × 569 × 1163

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,961,760

Proper Divisor Sum 3,991,278

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3970459 ← → #3970489

Radix Representation

Decimal	3970482
Binary	1111001001010110110010 (22 bits)
Octal	0o17112662
Hexadecimal	0x3C95B2

Divisor Catalog (16)

1 2 3 6 569 1,138 1,163 1,707 2,326 3,414 3,489 6,978 661,747 1,323,494 1,985,241 3,970,482

Collatz Trajectory (185 steps to reach 1)

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

3,970,482 1,985,241 5,955,724 2,977,862 1,488,931 4,466,794 2,233,397 6,700,192 3,350,096 1,675,048 837,524 418,762 209,381 628,144 314,072 157,036 78,518 39,259 117,778 58,889 176,668 88,334 44,167 132,502 66,251 198,754 99,377 298,132 149,066 74,533 223,600 111,800 55,900 27,950 13,975 41,926 20,963 62,890 31,445 94,336 47,168 23,584 11,792 5,896 2,948 1,474 737 2,212 1,106 553 1,660 830 415 1,246 623 1,870 935 2,806 1,403 4,210

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,970,481 Browse Full Index Next Integer #3,970,483 →