3,676,038

2 × 3 × 227 × 2699

3,676,038 factors as 2 × 3 × 227 × 2699. Its 16 positive divisors give a proper-divisor sum of 3,711,162, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2 × 3 × 227 × 2699

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,387,200

Proper Divisor Sum 3,711,162

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3676037 ← → #3676039

Radix Representation

Decimal	3676038
Binary	1110000001011110000110 (22 bits)
Octal	0o16013606
Hexadecimal	0x381786

Divisor Catalog (16)

1 2 3 6 227 454 681 1,362 2,699 5,398 8,097 16,194 612,673 1,225,346 1,838,019 3,676,038

Collatz Trajectory (84 steps to reach 1)

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

3,676,038 1,838,019 5,514,058 2,757,029 8,271,088 4,135,544 2,067,772 1,033,886 516,943 1,550,830 775,415 2,326,246 1,163,123 3,489,370 1,744,685 5,234,056 2,617,028 1,308,514 654,257 1,962,772 981,386 490,693 1,472,080 736,040 368,020 184,010 92,005 276,016 138,008 69,004 34,502 17,251 51,754 25,877 77,632 38,816 19,408 9,704 4,852 2,426 1,213 3,640 1,820 910 455 1,366 683 2,050 1,025 3,076 1,538 769 2,308 1,154 577 1,732 866 433 1,300 650

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,676,037 Browse Full Index Next Integer #3,676,039 →