3,940,470

2 × 3² × 5 × 43783

3,940,470 factors as 2 × 3^2 × 5 × 43783. Its 24 positive divisors give a proper-divisor sum of 6,304,986, so this integer is abundant. The Collatz stopping time is 66 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 43783

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 10,245,456

Proper Divisor Sum 6,304,986

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #3940457 ← → #3940483

Radix Representation

Decimal	3940470
Binary	1111000010000001110110 (22 bits)
Octal	0o17020166
Hexadecimal	0x3C2076

Divisor Catalog (24)

Collatz Trajectory (66 steps to reach 1)

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

3,940,470 1,970,235 5,910,706 2,955,353 8,866,060 4,433,030 2,216,515 6,649,546 3,324,773 9,974,320 4,987,160 2,493,580 1,246,790 623,395 1,870,186 935,093 2,805,280 1,402,640 701,320 350,660 175,330 87,665 262,996 131,498 65,749 197,248 98,624 49,312 24,656 12,328 6,164 3,082 1,541 4,624 2,312 1,156 578 289 868 434 217 652 326 163 490 245 736 368 184 92 46 23 70 35 106 53 160 80 40 20

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,940,469 Browse Full Index Next Integer #3,940,471 →