8,321,982

2 × 3 × 929 × 1493

8,321,982 factors as 2 × 3 × 929 × 1493. Its 16 positive divisors give a proper-divisor sum of 8,351,058, so this integer is abundant. The Collatz stopping time is 142 steps.

Prime Factor Structure

Factorization String 2 × 3 × 929 × 1493

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 16,673,040

Proper Divisor Sum 8,351,058

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #8321977 ← → #8321983

Radix Representation

Decimal	8321982
Binary	11111101111101110111110 (23 bits)
Octal	0o37575676
Hexadecimal	0x7EFBBE

Divisor Catalog (16)

1 2 3 6 929 1,493 1,858 2,787 2,986 4,479 5,574 8,958 1,386,997 2,773,994 4,160,991 8,321,982

Collatz Trajectory (142 steps to reach 1)

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

8,321,982 4,160,991 12,482,974 6,241,487 18,724,462 9,362,231 28,086,694 14,043,347 42,130,042 21,065,021 63,195,064 31,597,532 15,798,766 7,899,383 23,698,150 11,849,075 35,547,226 17,773,613 53,320,840 26,660,420 13,330,210 6,665,105 19,995,316 9,997,658 4,998,829 14,996,488 7,498,244 3,749,122 1,874,561 5,623,684 2,811,842 1,405,921 4,217,764 2,108,882 1,054,441 3,163,324 1,581,662 790,831 2,372,494 1,186,247 3,558,742 1,779,371 5,338,114 2,669,057 8,007,172 4,003,586 2,001,793 6,005,380 3,002,690 1,501,345 4,504,036 2,252,018 1,126,009 3,378,028 1,689,014 844,507 2,533,522 1,266,761 3,800,284 1,900,142

← Previous Integer #8,321,981 Browse Full Index Next Integer #8,321,983 →