1,183,830

2 × 3 × 5 × 39461

1,183,830 factors as 2 × 3 × 5 × 39461. Its 16 positive divisors give a proper-divisor sum of 1,657,434, so this integer is abundant. The Collatz stopping time is 85 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 39461

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,841,264

Proper Divisor Sum 1,657,434

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1183813 ← → #1183837

Radix Representation

Decimal	1183830
Binary	100100001000001010110 (21 bits)
Octal	0o4410126
Hexadecimal	0x121056

Divisor Catalog (16)

1 2 3 5 6 10 15 30 39,461 78,922 118,383 197,305 236,766 394,610 591,915 1,183,830

Collatz Trajectory (85 steps to reach 1)

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

1,183,830 591,915 1,775,746 887,873 2,663,620 1,331,810 665,905 1,997,716 998,858 499,429 1,498,288 749,144 374,572 187,286 93,643 280,930 140,465 421,396 210,698 105,349 316,048 158,024 79,012 39,506 19,753 59,260 29,630 14,815 44,446 22,223 66,670 33,335 100,006 50,003 150,010 75,005 225,016 112,508 56,254 28,127 84,382 42,191 126,574 63,287 189,862 94,931 284,794 142,397 427,192 213,596 106,798 53,399 160,198 80,099 240,298 120,149 360,448 180,224 90,112 45,056

← Previous Integer #1,183,829 Browse Full Index Next Integer #1,183,831 →