1,555,638

2 × 3 × 7 × 37039

1,555,638 factors as 2 × 3 × 7 × 37039. Its 16 positive divisors give a proper-divisor sum of 2,000,202, so this integer is abundant. The Collatz stopping time is 75 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 37039

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,555,840

Proper Divisor Sum 2,000,202

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1555637 ← → #1555639

Radix Representation

Decimal	1555638
Binary	101111011110010110110 (21 bits)
Octal	0o5736266
Hexadecimal	0x17BCB6

Divisor Catalog (16)

1 2 3 6 7 14 21 42 37,039 74,078 111,117 222,234 259,273 518,546 777,819 1,555,638

Collatz Trajectory (75 steps to reach 1)

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

1,555,638 777,819 2,333,458 1,166,729 3,500,188 1,750,094 875,047 2,625,142 1,312,571 3,937,714 1,968,857 5,906,572 2,953,286 1,476,643 4,429,930 2,214,965 6,644,896 3,322,448 1,661,224 830,612 415,306 207,653 622,960 311,480 155,740 77,870 38,935 116,806 58,403 175,210 87,605 262,816 131,408 65,704 32,852 16,426 8,213 24,640 12,320 6,160 3,080 1,540 770 385 1,156 578 289 868 434 217 652 326 163 490 245 736 368 184 92 46

← Previous Integer #1,555,637 Browse Full Index Next Integer #1,555,639 →