1,161,366

2 × 3 × 41 × 4721

1,161,366 factors as 2 × 3 × 41 × 4721. Its 16 positive divisors give a proper-divisor sum of 1,218,522, so this integer is abundant. The Collatz stopping time is 98 steps.

Prime Factor Structure

Factorization String 2 × 3 × 41 × 4721

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,379,888

Proper Divisor Sum 1,218,522

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1161343 ← → #1161371

Radix Representation

Decimal	1161366
Binary	100011011100010010110 (21 bits)
Octal	0o4334226
Hexadecimal	0x11B896

Divisor Catalog (16)

1 2 3 6 41 82 123 246 4,721 9,442 14,163 28,326 193,561 387,122 580,683 1,161,366

Collatz Trajectory (98 steps to reach 1)

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

1,161,366 580,683 1,742,050 871,025 2,613,076 1,306,538 653,269 1,959,808 979,904 489,952 244,976 122,488 61,244 30,622 15,311 45,934 22,967 68,902 34,451 103,354 51,677 155,032 77,516 38,758 19,379 58,138 29,069 87,208 43,604 21,802 10,901 32,704 16,352 8,176 4,088 2,044 1,022 511 1,534 767 2,302 1,151 3,454 1,727 5,182 2,591 7,774 3,887 11,662 5,831 17,494 8,747 26,242 13,121 39,364 19,682 9,841 29,524 14,762 7,381

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,161,365 Browse Full Index Next Integer #1,161,367 →