3,512,694

2 × 3 × 307 × 1907

3,512,694 factors as 2 × 3 × 307 × 1907. Its 16 positive divisors give a proper-divisor sum of 3,539,274, so this integer is abundant. The Collatz stopping time is 71 steps.

Prime Factor Structure

Factorization String 2 × 3 × 307 × 1907

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,051,968

Proper Divisor Sum 3,539,274

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3512689 ← → #3512699

Radix Representation

Decimal	3512694
Binary	1101011001100101110110 (22 bits)
Octal	0o15314566
Hexadecimal	0x359976

Divisor Catalog (16)

1 2 3 6 307 614 921 1,842 1,907 3,814 5,721 11,442 585,449 1,170,898 1,756,347 3,512,694

Collatz Trajectory (71 steps to reach 1)

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

3,512,694 1,756,347 5,269,042 2,634,521 7,903,564 3,951,782 1,975,891 5,927,674 2,963,837 8,891,512 4,445,756 2,222,878 1,111,439 3,334,318 1,667,159 5,001,478 2,500,739 7,502,218 3,751,109 11,253,328 5,626,664 2,813,332 1,406,666 703,333 2,110,000 1,055,000 527,500 263,750 131,875 395,626 197,813 593,440 296,720 148,360 74,180 37,090 18,545 55,636 27,818 13,909 41,728 20,864 10,432 5,216 2,608 1,304 652 326 163 490 245 736 368 184 92 46 23 70 35 106

← Previous Integer #3,512,693 Browse Full Index Next Integer #3,512,695 →