11,601,716

2² × 7 × 414347

11,601,716 factors as 2^2 × 7 × 414347. Its 12 positive divisors give a proper-divisor sum of 11,601,772, so this integer is abundant. The Collatz stopping time is 96 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 414347

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 23,203,488

Proper Divisor Sum 11,601,772

Digit Sum / Digital Root 23 (Root: 5)

Adjacent Primes #11601679 ← → #11601721

Radix Representation

Decimal	11601716
Binary	101100010000011100110100 (24 bits)
Octal	0o54203464
Hexadecimal	0xB10734

Divisor Catalog (12)

1 2 4 7 14 28 414,347 828,694 1,657,388 2,900,429 5,800,858 11,601,716

Collatz Trajectory (96 steps to reach 1)

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

11,601,716 5,800,858 2,900,429 8,701,288 4,350,644 2,175,322 1,087,661 3,262,984 1,631,492 815,746 407,873 1,223,620 611,810 305,905 917,716 458,858 229,429 688,288 344,144 172,072 86,036 43,018 21,509 64,528 32,264 16,132 8,066 4,033 12,100 6,050 3,025 9,076 4,538 2,269 6,808 3,404 1,702 851 2,554 1,277 3,832 1,916 958 479 1,438 719 2,158 1,079 3,238 1,619 4,858 2,429 7,288 3,644 1,822 911 2,734 1,367 4,102 2,051

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #11,601,715 Browse Full Index Next Integer #11,601,717 →