160,644

2² × 3 × 11 × 1217

160,644 factors as 2^2 × 3 × 11 × 1217. Its 24 positive divisors give a proper-divisor sum of 248,604, so this integer is abundant. The Collatz stopping time is 69 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 11 × 1217

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 409,248

Proper Divisor Sum 248,604

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #160639 ← → #160649

Radix Representation

Decimal	160644
Binary	100111001110000100 (18 bits)
Octal	0o471604
Hexadecimal	0x27384

Divisor Catalog (24)

1 2 3 4 6 11 12 22 33 44 66 132 1,217 2,434 3,651 4,868 7,302 13,387 14,604 26,774 40,161 53,548 80,322 160,644

Collatz Trajectory (69 steps to reach 1)

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

160,644 80,322 40,161 120,484 60,242 30,121 90,364 45,182 22,591 67,774 33,887 101,662 50,831 152,494 76,247 228,742 114,371 343,114 171,557 514,672 257,336 128,668 64,334 32,167 96,502 48,251 144,754 72,377 217,132 108,566 54,283 162,850 81,425 244,276 122,138 61,069 183,208 91,604 45,802 22,901 68,704 34,352 17,176 8,588 4,294 2,147 6,442 3,221 9,664 4,832 2,416 1,208 604 302 151 454 227 682 341 1,024

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #160,643 Browse Full Index Next Integer #160,645 →