3,557,706

2 × 3 × 349 × 1699

3,557,706 factors as 2 × 3 × 349 × 1699. Its 16 positive divisors give a proper-divisor sum of 3,582,294, so this integer is abundant. The Collatz stopping time is 309 steps.

Prime Factor Structure

Factorization String 2 × 3 × 349 × 1699

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,140,000

Proper Divisor Sum 3,582,294

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3557699 ← → #3557713

Radix Representation

Decimal	3557706
Binary	1101100100100101001010 (22 bits)
Octal	0o15444512
Hexadecimal	0x36494A

Divisor Catalog (16)

1 2 3 6 349 698 1,047 1,699 2,094 3,398 5,097 10,194 592,951 1,185,902 1,778,853 3,557,706

Collatz Trajectory (309 steps to reach 1)

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

3,557,706 1,778,853 5,336,560 2,668,280 1,334,140 667,070 333,535 1,000,606 500,303 1,500,910 750,455 2,251,366 1,125,683 3,377,050 1,688,525 5,065,576 2,532,788 1,266,394 633,197 1,899,592 949,796 474,898 237,449 712,348 356,174 178,087 534,262 267,131 801,394 400,697 1,202,092 601,046 300,523 901,570 450,785 1,352,356 676,178 338,089 1,014,268 507,134 253,567 760,702 380,351 1,141,054 570,527 1,711,582 855,791 2,567,374 1,283,687 3,851,062 1,925,531 5,776,594 2,888,297 8,664,892 4,332,446 2,166,223 6,498,670 3,249,335 9,748,006 4,874,003

← Previous Integer #3,557,705 Browse Full Index Next Integer #3,557,707 →