11,611,434

2 × 3 × 1935239

11,611,434 factors as 2 × 3 × 1935239. Its 8 positive divisors give a proper-divisor sum of 11,611,446, so this integer is abundant. The Collatz stopping time is 96 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1935239

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 23,222,880

Proper Divisor Sum 11,611,446

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #11611433 ← → #11611441

Radix Representation

Decimal	11611434
Binary	101100010010110100101010 (24 bits)
Octal	0o54226452
Hexadecimal	0xB12D2A

Divisor Catalog (8)

1 2 3 6 1,935,239 3,870,478 5,805,717 11,611,434

Collatz Trajectory (96 steps to reach 1)

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

11,611,434 5,805,717 17,417,152 8,708,576 4,354,288 2,177,144 1,088,572 544,286 272,143 816,430 408,215 1,224,646 612,323 1,836,970 918,485 2,755,456 1,377,728 688,864 344,432 172,216 86,108 43,054 21,527 64,582 32,291 96,874 48,437 145,312 72,656 36,328 18,164 9,082 4,541 13,624 6,812 3,406 1,703 5,110 2,555 7,666 3,833 11,500 5,750 2,875 8,626 4,313 12,940 6,470 3,235 9,706 4,853 14,560 7,280 3,640 1,820 910 455 1,366 683 2,050

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #11,611,433 Browse Full Index Next Integer #11,611,435 →