870,882

2 × 3 × 173 × 839

870,882 factors as 2 × 3 × 173 × 839. Its 16 positive divisors give a proper-divisor sum of 883,038, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2 × 3 × 173 × 839

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,753,920

Proper Divisor Sum 883,038

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #870871 ← → #870889

Radix Representation

Decimal	870882
Binary	11010100100111100010 (20 bits)
Octal	0o3244742
Hexadecimal	0xD49E2

Divisor Catalog (16)

1 2 3 6 173 346 519 839 1,038 1,678 2,517 5,034 145,147 290,294 435,441 870,882

Collatz Trajectory (95 steps to reach 1)

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

870,882 435,441 1,306,324 653,162 326,581 979,744 489,872 244,936 122,468 61,234 30,617 91,852 45,926 22,963 68,890 34,445 103,336 51,668 25,834 12,917 38,752 19,376 9,688 4,844 2,422 1,211 3,634 1,817 5,452 2,726 1,363 4,090 2,045 6,136 3,068 1,534 767 2,302 1,151 3,454 1,727 5,182 2,591 7,774 3,887 11,662 5,831 17,494 8,747 26,242 13,121 39,364 19,682 9,841 29,524 14,762 7,381 22,144 11,072 5,536

← Previous Integer #870,881 Browse Full Index Next Integer #870,883 →