3,600,108

2² × 3² × 100003

3,600,108 factors as 2^2 × 3^2 × 100003. Its 18 positive divisors give a proper-divisor sum of 5,500,256, so this integer is abundant. The Collatz stopping time is 234 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 100003

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 9,100,364

Proper Divisor Sum 5,500,256

Digit Sum / Digital Root 18 (Root: 9)

Adjacent Primes #3600097 ← → #3600119

Radix Representation

Decimal	3600108
Binary	1101101110111011101100 (22 bits)
Octal	0o15567354
Hexadecimal	0x36EEEC

Divisor Catalog (18)

1 2 3 4 6 9 12 18 36 100,003 200,006 300,009 400,012 600,018 900,027 1,200,036 1,800,054 3,600,108

Collatz Trajectory (234 steps to reach 1)

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

3,600,108 1,800,054 900,027 2,700,082 1,350,041 4,050,124 2,025,062 1,012,531 3,037,594 1,518,797 4,556,392 2,278,196 1,139,098 569,549 1,708,648 854,324 427,162 213,581 640,744 320,372 160,186 80,093 240,280 120,140 60,070 30,035 90,106 45,053 135,160 67,580 33,790 16,895 50,686 25,343 76,030 38,015 114,046 57,023 171,070 85,535 256,606 128,303 384,910 192,455 577,366 288,683 866,050 433,025 1,299,076 649,538 324,769 974,308 487,154 243,577 730,732 365,366 182,683 548,050 274,025 822,076

← Previous Integer #3,600,107 Browse Full Index Next Integer #3,600,109 →