2,044,038

2 × 3 × 101 × 3373

2,044,038 factors as 2 × 3 × 101 × 3373. Its 16 positive divisors give a proper-divisor sum of 2,085,738, so this integer is abundant. The Collatz stopping time is 153 steps.

Prime Factor Structure

Factorization String 2 × 3 × 101 × 3373

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,129,776

Proper Divisor Sum 2,085,738

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #2044037 ← → #2044043

Radix Representation

Decimal	2044038
Binary	111110011000010000110 (21 bits)
Octal	0o7630206
Hexadecimal	0x1F3086

Divisor Catalog (16)

1 2 3 6 101 202 303 606 3,373 6,746 10,119 20,238 340,673 681,346 1,022,019 2,044,038

Collatz Trajectory (153 steps to reach 1)

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

2,044,038 1,022,019 3,066,058 1,533,029 4,599,088 2,299,544 1,149,772 574,886 287,443 862,330 431,165 1,293,496 646,748 323,374 161,687 485,062 242,531 727,594 363,797 1,091,392 545,696 272,848 136,424 68,212 34,106 17,053 51,160 25,580 12,790 6,395 19,186 9,593 28,780 14,390 7,195 21,586 10,793 32,380 16,190 8,095 24,286 12,143 36,430 18,215 54,646 27,323 81,970 40,985 122,956 61,478 30,739 92,218 46,109 138,328 69,164 34,582 17,291 51,874 25,937 77,812

← Previous Integer #2,044,037 Browse Full Index Next Integer #2,044,039 →