1,096,716

2² × 3 × 91393

1,096,716 factors as 2^2 × 3 × 91393. Its 12 positive divisors give a proper-divisor sum of 1,462,316, so this integer is abundant. The Collatz stopping time is 209 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 91393

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 2,559,032

Proper Divisor Sum 1,462,316

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1096703 ← → #1096727

Radix Representation

Decimal	1096716
Binary	100001011110000001100 (21 bits)
Octal	0o4136014
Hexadecimal	0x10BC0C

Divisor Catalog (12)

1 2 3 4 6 12 91,393 182,786 274,179 365,572 548,358 1,096,716

Collatz Trajectory (209 steps to reach 1)

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

1,096,716 548,358 274,179 822,538 411,269 1,233,808 616,904 308,452 154,226 77,113 231,340 115,670 57,835 173,506 86,753 260,260 130,130 65,065 195,196 97,598 48,799 146,398 73,199 219,598 109,799 329,398 164,699 494,098 247,049 741,148 370,574 185,287 555,862 277,931 833,794 416,897 1,250,692 625,346 312,673 938,020 469,010 234,505 703,516 351,758 175,879 527,638 263,819 791,458 395,729 1,187,188 593,594 296,797 890,392 445,196 222,598 111,299 333,898 166,949 500,848 250,424

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,096,715 Browse Full Index Next Integer #1,096,717 →