4,201,674

2 × 3 × 700279

4,201,674 factors as 2 × 3 × 700279. Its 8 positive divisors give a proper-divisor sum of 4,201,686, so this integer is abundant. The Collatz stopping time is 74 steps.

Prime Factor Structure

Factorization String 2 × 3 × 700279

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 8,403,360

Proper Divisor Sum 4,201,686

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4201649 ← → #4201699

Radix Representation

Decimal	4201674
Binary	10000000001110011001010 (23 bits)
Octal	0o20016312
Hexadecimal	0x401CCA

Divisor Catalog (8)

1 2 3 6 700,279 1,400,558 2,100,837 4,201,674

Collatz Trajectory (74 steps to reach 1)

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

4,201,674 2,100,837 6,302,512 3,151,256 1,575,628 787,814 393,907 1,181,722 590,861 1,772,584 886,292 443,146 221,573 664,720 332,360 166,180 83,090 41,545 124,636 62,318 31,159 93,478 46,739 140,218 70,109 210,328 105,164 52,582 26,291 78,874 39,437 118,312 59,156 29,578 14,789 44,368 22,184 11,092 5,546 2,773 8,320 4,160 2,080 1,040 520 260 130 65 196 98 49 148 74 37 112 56 28 14 7 22

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,201,673 Browse Full Index Next Integer #4,201,675 →