659,544

2³ × 3 × 27481

659,544 factors as 2^3 × 3 × 27481. Its 16 positive divisors give a proper-divisor sum of 989,376, so this integer is abundant. The Collatz stopping time is 198 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 27481

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,648,920

Proper Divisor Sum 989,376

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #659539 ← → #659563

Radix Representation

Decimal	659544
Binary	10100001000001011000 (20 bits)
Octal	0o2410130
Hexadecimal	0xA1058

Divisor Catalog (16)

1 2 3 4 6 8 12 24 27,481 54,962 82,443 109,924 164,886 219,848 329,772 659,544

Collatz Trajectory (198 steps to reach 1)

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

659,544 329,772 164,886 82,443 247,330 123,665 370,996 185,498 92,749 278,248 139,124 69,562 34,781 104,344 52,172 26,086 13,043 39,130 19,565 58,696 29,348 14,674 7,337 22,012 11,006 5,503 16,510 8,255 24,766 12,383 37,150 18,575 55,726 27,863 83,590 41,795 125,386 62,693 188,080 94,040 47,020 23,510 11,755 35,266 17,633 52,900 26,450 13,225 39,676 19,838 9,919 29,758 14,879 44,638 22,319 66,958 33,479 100,438 50,219 150,658

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #659,543 Browse Full Index Next Integer #659,545 →