976,062

2 × 3 × 162677

976,062 factors as 2 × 3 × 162677. Its 8 positive divisors give a proper-divisor sum of 976,074, so this integer is abundant. The Collatz stopping time is 183 steps.

Prime Factor Structure

Factorization String 2 × 3 × 162677

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 1,952,136

Proper Divisor Sum 976,074

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #976039 ← → #976091

Radix Representation

Decimal	976062
Binary	11101110010010111110 (20 bits)
Octal	0o3562276
Hexadecimal	0xEE4BE

Divisor Catalog (8)

1 2 3 6 162,677 325,354 488,031 976,062

Collatz Trajectory (183 steps to reach 1)

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

976,062 488,031 1,464,094 732,047 2,196,142 1,098,071 3,294,214 1,647,107 4,941,322 2,470,661 7,411,984 3,705,992 1,852,996 926,498 463,249 1,389,748 694,874 347,437 1,042,312 521,156 260,578 130,289 390,868 195,434 97,717 293,152 146,576 73,288 36,644 18,322 9,161 27,484 13,742 6,871 20,614 10,307 30,922 15,461 46,384 23,192 11,596 5,798 2,899 8,698 4,349 13,048 6,524 3,262 1,631 4,894 2,447 7,342 3,671 11,014 5,507 16,522 8,261 24,784 12,392 6,196

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #976,061 Browse Full Index Next Integer #976,063 →