689,248

2⁵ × 7 × 17 × 181

689,248 factors as 2^5 × 7 × 17 × 181. Its 48 positive divisors give a proper-divisor sum of 961,856, so this integer is abundant. The Collatz stopping time is 123 steps.

Prime Factor Structure

Factorization String 2^5 × 7 × 17 × 181

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 1,651,104

Proper Divisor Sum 961,856

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #689237 ← → #689257

Radix Representation

Decimal	689248
Binary	10101000010001100000 (20 bits)
Octal	0o2502140
Hexadecimal	0xA8460

Divisor Catalog (48)

1 2 4 7 8 14 16 17 28 32 34 56 68 112 119 136 181 224 238 272 362 476 544 724 952 1,267 1,448 1,904 2,534 2,896 3,077 3,808 5,068 5,792 6,154 10,136 12,308 20,272 21,539 24,616 40,544 43,078 49,232 86,156 98,464 172,312 344,624 689,248

Collatz Trajectory (123 steps to reach 1)

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

689,248 344,624 172,312 86,156 43,078 21,539 64,618 32,309 96,928 48,464 24,232 12,116 6,058 3,029 9,088 4,544 2,272 1,136 568 284 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890 445 1,336 668 334 167 502 251 754

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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