6,671,820

2² × 3 × 5 × 17 × 31 × 211

6,671,820 factors as 2^2 × 3 × 5 × 17 × 31 × 211. Its 96 positive divisors give a proper-divisor sum of 13,842,996, so this integer is abundant. The Collatz stopping time is 85 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 17 × 31 × 211

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 20,514,816

Proper Divisor Sum 13,842,996

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6671809 ← → #6671839

Radix Representation

Decimal	6671820
Binary	11001011100110111001100 (23 bits)
Octal	0o31346714
Hexadecimal	0x65CDCC

Divisor Catalog (60 of 96)

1 2 3 4 5 6 10 12 15 17 20 30 31 34 51 60 62 68 85 93 102 124 155 170 186 204 211 255 310 340 372 422 465 510 527 620 633 844 930 1,020 1,054 1,055 1,266 1,581 1,860 2,108 2,110 2,532 2,635 3,162 3,165 3,587 4,220 5,270 6,324 6,330 6,541 7,174 7,905 10,540

Collatz Trajectory (85 steps to reach 1)

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

6,671,820 3,335,910 1,667,955 5,003,866 2,501,933 7,505,800 3,752,900 1,876,450 938,225 2,814,676 1,407,338 703,669 2,111,008 1,055,504 527,752 263,876 131,938 65,969 197,908 98,954 49,477 148,432 74,216 37,108 18,554 9,277 27,832 13,916 6,958 3,479 10,438 5,219 15,658 7,829 23,488 11,744 5,872 2,936 1,468 734 367 1,102 551 1,654 827 2,482 1,241 3,724 1,862 931 2,794 1,397 4,192 2,096 1,048 524 262 131 394 197

← Previous Integer #6,671,819 Browse Full Index Next Integer #6,671,821 →