1,161,588

2² × 3 × 96799

1,161,588 factors as 2^2 × 3 × 96799. Its 12 positive divisors give a proper-divisor sum of 1,548,812, so this integer is abundant. The Collatz stopping time is 98 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 96799

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 2,710,400

Proper Divisor Sum 1,548,812

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #1161581 ← → #1161599

Radix Representation

Decimal	1161588
Binary	100011011100101110100 (21 bits)
Octal	0o4334564
Hexadecimal	0x11B974

Divisor Catalog (12)

1 2 3 4 6 12 96,799 193,598 290,397 387,196 580,794 1,161,588

Collatz Trajectory (98 steps to reach 1)

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

1,161,588 580,794 290,397 871,192 435,596 217,798 108,899 326,698 163,349 490,048 245,024 122,512 61,256 30,628 15,314 7,657 22,972 11,486 5,743 17,230 8,615 25,846 12,923 38,770 19,385 58,156 29,078 14,539 43,618 21,809 65,428 32,714 16,357 49,072 24,536 12,268 6,134 3,067 9,202 4,601 13,804 6,902 3,451 10,354 5,177 15,532 7,766 3,883 11,650 5,825 17,476 8,738 4,369 13,108 6,554 3,277 9,832 4,916 2,458 1,229

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,161,587 Browse Full Index Next Integer #1,161,589 →