3,970,422

2 × 3² × 220579

3,970,422 factors as 2 × 3^2 × 220579. Its 12 positive divisors give a proper-divisor sum of 4,632,198, so this integer is abundant. The Collatz stopping time is 185 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 220579

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 8,602,620

Proper Divisor Sum 4,632,198

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #3970409 ← → #3970423

Radix Representation

Decimal	3970422
Binary	1111001001010101110110 (22 bits)
Octal	0o17112566
Hexadecimal	0x3C9576

Divisor Catalog (12)

1 2 3 6 9 18 220,579 441,158 661,737 1,323,474 1,985,211 3,970,422

Collatz Trajectory (185 steps to reach 1)

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

3,970,422 1,985,211 5,955,634 2,977,817 8,933,452 4,466,726 2,233,363 6,700,090 3,350,045 10,050,136 5,025,068 2,512,534 1,256,267 3,768,802 1,884,401 5,653,204 2,826,602 1,413,301 4,239,904 2,119,952 1,059,976 529,988 264,994 132,497 397,492 198,746 99,373 298,120 149,060 74,530 37,265 111,796 55,898 27,949 83,848 41,924 20,962 10,481 31,444 15,722 7,861 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,421 Browse Full Index Next Integer #3,970,423 →