1,555,782

2 × 3 × 199 × 1303

1,555,782 factors as 2 × 3 × 199 × 1303. Its 16 positive divisors give a proper-divisor sum of 1,573,818, so this integer is abundant. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2 × 3 × 199 × 1303

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,129,600

Proper Divisor Sum 1,573,818

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1555781 ← → #1555787

Radix Representation

Decimal	1555782
Binary	101111011110101000110 (21 bits)
Octal	0o5736506
Hexadecimal	0x17BD46

Divisor Catalog (16)

1 2 3 6 199 398 597 1,194 1,303 2,606 3,909 7,818 259,297 518,594 777,891 1,555,782

Collatz Trajectory (132 steps to reach 1)

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

1,555,782 777,891 2,333,674 1,166,837 3,500,512 1,750,256 875,128 437,564 218,782 109,391 328,174 164,087 492,262 246,131 738,394 369,197 1,107,592 553,796 276,898 138,449 415,348 207,674 103,837 311,512 155,756 77,878 38,939 116,818 58,409 175,228 87,614 43,807 131,422 65,711 197,134 98,567 295,702 147,851 443,554 221,777 665,332 332,666 166,333 499,000 249,500 124,750 62,375 187,126 93,563 280,690 140,345 421,036 210,518 105,259 315,778 157,889 473,668 236,834 118,417 355,252

← Previous Integer #1,555,781 Browse Full Index Next Integer #1,555,783 →