8,100,976

2⁴ × 13 × 17 × 29 × 79

8,100,976 factors as 2^4 × 13 × 17 × 29 × 79. Its 80 positive divisors give a proper-divisor sum of 10,647,824, so this integer is abundant. The Collatz stopping time is 199 steps.

Prime Factor Structure

Factorization String 2^4 × 13 × 17 × 29 × 79

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 80

Divisor Sum (σ) 18,748,800

Proper Divisor Sum 10,647,824

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #8100943 ← → #8100977

Radix Representation

Decimal	8100976
Binary	11110111001110001110000 (23 bits)
Octal	0o36716160
Hexadecimal	0x7B9C70

Divisor Catalog (60 of 80)

1 2 4 8 13 16 17 26 29 34 52 58 68 79 104 116 136 158 208 221 232 272 316 377 442 464 493 632 754 884 986 1,027 1,264 1,343 1,508 1,768 1,972 2,054 2,291 2,686 3,016 3,536 3,944 4,108 4,582 5,372 6,032 6,409 7,888 8,216 9,164 10,744 12,818 16,432 17,459 18,328 21,488 25,636 29,783 34,918

Collatz Trajectory (199 steps to reach 1)

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

8,100,976 4,050,488 2,025,244 1,012,622 506,311 1,518,934 759,467 2,278,402 1,139,201 3,417,604 1,708,802 854,401 2,563,204 1,281,602 640,801 1,922,404 961,202 480,601 1,441,804 720,902 360,451 1,081,354 540,677 1,622,032 811,016 405,508 202,754 101,377 304,132 152,066 76,033 228,100 114,050 57,025 171,076 85,538 42,769 128,308 64,154 32,077 96,232 48,116 24,058 12,029 36,088 18,044 9,022 4,511 13,534 6,767 20,302 10,151 30,454 15,227 45,682 22,841 68,524 34,262 17,131 51,394

← Previous Integer #8,100,975 Browse Full Index Next Integer #8,100,977 →