978,762

2 × 3 × 163127

978,762 factors as 2 × 3 × 163127. Its 8 positive divisors give a proper-divisor sum of 978,774, so this integer is abundant. The Collatz stopping time is 139 steps.

Prime Factor Structure

Factorization String 2 × 3 × 163127

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 1,957,536

Proper Divisor Sum 978,774

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #978749 ← → #978773

Radix Representation

Decimal	978762
Binary	11101110111101001010 (20 bits)
Octal	0o3567512
Hexadecimal	0xEEF4A

Divisor Catalog (8)

1 2 3 6 163,127 326,254 489,381 978,762

Collatz Trajectory (139 steps to reach 1)

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

978,762 489,381 1,468,144 734,072 367,036 183,518 91,759 275,278 137,639 412,918 206,459 619,378 309,689 929,068 464,534 232,267 696,802 348,401 1,045,204 522,602 261,301 783,904 391,952 195,976 97,988 48,994 24,497 73,492 36,746 18,373 55,120 27,560 13,780 6,890 3,445 10,336 5,168 2,584 1,292 646 323 970 485 1,456 728 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #978,761 Browse Full Index Next Integer #978,763 →