258,684

2² × 3 × 21557

258,684 factors as 2^2 × 3 × 21557. Its 12 positive divisors give a proper-divisor sum of 344,940, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 21557

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 603,624

Proper Divisor Sum 344,940

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #258677 ← → #258691

Radix Representation

Decimal	258684
Binary	111111001001111100 (18 bits)
Octal	0o771174
Hexadecimal	0x3F27C

Divisor Catalog (12)

1 2 3 4 6 12 21,557 43,114 64,671 86,228 129,342 258,684

Collatz Trajectory (88 steps to reach 1)

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

258,684 129,342 64,671 194,014 97,007 291,022 145,511 436,534 218,267 654,802 327,401 982,204 491,102 245,551 736,654 368,327 1,104,982 552,491 1,657,474 828,737 2,486,212 1,243,106 621,553 1,864,660 932,330 466,165 1,398,496 699,248 349,624 174,812 87,406 43,703 131,110 65,555 196,666 98,333 295,000 147,500 73,750 36,875 110,626 55,313 165,940 82,970 41,485 124,456 62,228 31,114 15,557 46,672 23,336 11,668 5,834 2,917 8,752 4,376 2,188 1,094 547 1,642

← Previous Integer #258,683 Browse Full Index Next Integer #258,685 →