1,180,578

2 × 3 × 7 × 28109

1,180,578 factors as 2 × 3 × 7 × 28109. Its 16 positive divisors give a proper-divisor sum of 1,517,982, so this integer is abundant. The Collatz stopping time is 98 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 28109

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,698,560

Proper Divisor Sum 1,517,982

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1180577 ← → #1180591

Radix Representation

Decimal	1180578
Binary	100100000001110100010 (21 bits)
Octal	0o4401642
Hexadecimal	0x1203A2

Divisor Catalog (16)

1 2 3 6 7 14 21 42 28,109 56,218 84,327 168,654 196,763 393,526 590,289 1,180,578

Collatz Trajectory (98 steps to reach 1)

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

1,180,578 590,289 1,770,868 885,434 442,717 1,328,152 664,076 332,038 166,019 498,058 249,029 747,088 373,544 186,772 93,386 46,693 140,080 70,040 35,020 17,510 8,755 26,266 13,133 39,400 19,700 9,850 4,925 14,776 7,388 3,694 1,847 5,542 2,771 8,314 4,157 12,472 6,236 3,118 1,559 4,678 2,339 7,018 3,509 10,528 5,264 2,632 1,316 658 329 988 494 247 742 371 1,114 557 1,672 836 418 209

← Previous Integer #1,180,577 Browse Full Index Next Integer #1,180,579 →