11,617,332

2² × 3 × 968111

11,617,332 factors as 2^2 × 3 × 968111. Its 12 positive divisors give a proper-divisor sum of 15,489,804, so this integer is abundant. The Collatz stopping time is 140 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 968111

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 27,107,136

Proper Divisor Sum 15,489,804

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #11617327 ← → #11617337

Radix Representation

Decimal	11617332
Binary	101100010100010000110100 (24 bits)
Octal	0o54242064
Hexadecimal	0xB14434

Divisor Catalog (12)

1 2 3 4 6 12 968,111 1,936,222 2,904,333 3,872,444 5,808,666 11,617,332

Collatz Trajectory (140 steps to reach 1)

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

11,617,332 5,808,666 2,904,333 8,713,000 4,356,500 2,178,250 1,089,125 3,267,376 1,633,688 816,844 408,422 204,211 612,634 306,317 918,952 459,476 229,738 114,869 344,608 172,304 86,152 43,076 21,538 10,769 32,308 16,154 8,077 24,232 12,116 6,058 3,029 9,088 4,544 2,272 1,136 568 284 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700 350

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #11,617,331 Browse Full Index Next Integer #11,617,333 →