689,286

2 × 3 × 13 × 8837

689,286 factors as 2 × 3 × 13 × 8837. Its 16 positive divisors give a proper-divisor sum of 795,498, so this integer is abundant. The Collatz stopping time is 198 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 8837

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,484,784

Proper Divisor Sum 795,498

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #689279 ← → #689291

Radix Representation

Decimal	689286
Binary	10101000010010000110 (20 bits)
Octal	0o2502206
Hexadecimal	0xA8486

Divisor Catalog (16)

1 2 3 6 13 26 39 78 8,837 17,674 26,511 53,022 114,881 229,762 344,643 689,286

Collatz Trajectory (198 steps to reach 1)

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

689,286 344,643 1,033,930 516,965 1,550,896 775,448 387,724 193,862 96,931 290,794 145,397 436,192 218,096 109,048 54,524 27,262 13,631 40,894 20,447 61,342 30,671 92,014 46,007 138,022 69,011 207,034 103,517 310,552 155,276 77,638 38,819 116,458 58,229 174,688 87,344 43,672 21,836 10,918 5,459 16,378 8,189 24,568 12,284 6,142 3,071 9,214 4,607 13,822 6,911 20,734 10,367 31,102 15,551 46,654 23,327 69,982 34,991 104,974 52,487 157,462

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #689,285 Browse Full Index Next Integer #689,287 →