3,603,696

2⁴ × 3 × 193 × 389

3,603,696 factors as 2^4 × 3 × 193 × 389. Its 40 positive divisors give a proper-divisor sum of 5,778,144, so this integer is abundant. The Collatz stopping time is 115 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 193 × 389

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 9,381,840

Proper Divisor Sum 5,778,144

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #3603667 ← → #3603703

Radix Representation

Decimal	3603696
Binary	1101101111110011110000 (22 bits)
Octal	0o15576360
Hexadecimal	0x36FCF0

Divisor Catalog (40)

1 2 3 4 6 8 12 16 24 48 193 386 389 579 772 778 1,158 1,167 1,544 1,556 2,316 2,334 3,088 3,112 4,632 4,668 6,224 9,264 9,336 18,672 75,077 150,154 225,231 300,308 450,462 600,616 900,924 1,201,232 1,801,848 3,603,696

Collatz Trajectory (115 steps to reach 1)

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

3,603,696 1,801,848 900,924 450,462 225,231 675,694 337,847 1,013,542 506,771 1,520,314 760,157 2,280,472 1,140,236 570,118 285,059 855,178 427,589 1,282,768 641,384 320,692 160,346 80,173 240,520 120,260 60,130 30,065 90,196 45,098 22,549 67,648 33,824 16,912 8,456 4,228 2,114 1,057 3,172 1,586 793 2,380 1,190 595 1,786 893 2,680 1,340 670 335 1,006 503 1,510 755 2,266 1,133 3,400 1,700 850 425 1,276 638

← Previous Integer #3,603,695 Browse Full Index Next Integer #3,603,697 →