951,978

2 × 3 × 158663

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

Prime Factor Structure

Factorization String 2 × 3 × 158663

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 1,903,968

Proper Divisor Sum 951,990

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #951967 ← → #951997

Radix Representation

Decimal	951978
Binary	11101000011010101010 (20 bits)
Octal	0o3503252
Hexadecimal	0xE86AA

Divisor Catalog (8)

1 2 3 6 158,663 317,326 475,989 951,978

Collatz Trajectory (139 steps to reach 1)

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

951,978 475,989 1,427,968 713,984 356,992 178,496 89,248 44,624 22,312 11,156 5,578 2,789 8,368 4,184 2,092 1,046 523 1,570 785 2,356 1,178 589 1,768 884 442 221 664 332 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 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 #951,977 Browse Full Index Next Integer #951,979 →