661,248

2⁸ × 3² × 7 × 41

661,248 factors as 2^8 × 3^2 × 7 × 41. Its 108 positive divisors give a proper-divisor sum of 1,570,800, so this integer is abundant. The Collatz stopping time is 61 steps.

Prime Factor Structure

Factorization String 2^8 × 3^2 × 7 × 41

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 108

Divisor Sum (σ) 2,232,048

Proper Divisor Sum 1,570,800

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #661237 ← → #661253

Radix Representation

Decimal	661248
Binary	10100001011100000000 (20 bits)
Octal	0o2413400
Hexadecimal	0xA1700

Divisor Catalog (60 of 108)

1 2 3 4 6 7 8 9 12 14 16 18 21 24 28 32 36 41 42 48 56 63 64 72 82 84 96 112 123 126 128 144 164 168 192 224 246 252 256 287 288 328 336 369 384 448 492 504 574 576 656 672 738 768 861 896 984 1,008 1,148 1,152

Collatz Trajectory (61 steps to reach 1)

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

661,248 330,624 165,312 82,656 41,328 20,664 10,332 5,166 2,583 7,750 3,875 11,626 5,813 17,440 8,720 4,360 2,180 1,090 545 1,636 818 409 1,228 614 307 922 461 1,384 692 346 173 520 260 130 65 196 98 49 148 74 37 112 56 28 14 7 22 11 34 17 52 26 13 40 20 10 5 16 8 4

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #661,247 Browse Full Index Next Integer #661,249 →