1,880,736

2⁵ × 3 × 11 × 13 × 137

1,880,736 factors as 2^5 × 3 × 11 × 13 × 137. Its 96 positive divisors give a proper-divisor sum of 3,961,632, so this integer is abundant. The Collatz stopping time is 171 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 11 × 13 × 137

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 5,842,368

Proper Divisor Sum 3,961,632

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1880729 ← → #1880741

Radix Representation

Decimal	1880736
Binary	111001011001010100000 (21 bits)
Octal	0o7131240
Hexadecimal	0x1CB2A0

Divisor Catalog (60 of 96)

1 2 3 4 6 8 11 12 13 16 22 24 26 32 33 39 44 48 52 66 78 88 96 104 132 137 143 156 176 208 264 274 286 312 352 411 416 429 528 548 572 624 822 858 1,056 1,096 1,144 1,248 1,507 1,644 1,716 1,781 2,192 2,288 3,014 3,288 3,432 3,562 4,384 4,521

Collatz Trajectory (171 steps to reach 1)

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

1,880,736 940,368 470,184 235,092 117,546 58,773 176,320 88,160 44,080 22,040 11,020 5,510 2,755 8,266 4,133 12,400 6,200 3,100 1,550 775 2,326 1,163 3,490 1,745 5,236 2,618 1,309 3,928 1,964 982 491 1,474 737 2,212 1,106 553 1,660 830 415 1,246 623 1,870 935 2,806 1,403 4,210 2,105 6,316 3,158 1,579 4,738 2,369 7,108 3,554 1,777 5,332 2,666 1,333 4,000 2,000

← Previous Integer #1,880,735 Browse Full Index Next Integer #1,880,737 →