6,604,986

2 × 3 × 1100831

6,604,986 factors as 2 × 3 × 1100831. Its 8 positive divisors give a proper-divisor sum of 6,604,998, so this integer is abundant. The Collatz stopping time is 72 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1100831

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,209,984

Proper Divisor Sum 6,604,998

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #6604973 ← → #6604987

Radix Representation

Decimal	6604986
Binary	11001001100100010111010 (23 bits)
Octal	0o31144272
Hexadecimal	0x64C8BA

Divisor Catalog (8)

1 2 3 6 1,100,831 2,201,662 3,302,493 6,604,986

Collatz Trajectory (72 steps to reach 1)

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

6,604,986 3,302,493 9,907,480 4,953,740 2,476,870 1,238,435 3,715,306 1,857,653 5,572,960 2,786,480 1,393,240 696,620 348,310 174,155 522,466 261,233 783,700 391,850 195,925 587,776 293,888 146,944 73,472 36,736 18,368 9,184 4,592 2,296 1,148 574 287 862 431 1,294 647 1,942 971 2,914 1,457 4,372 2,186 1,093 3,280 1,640 820 410 205 616 308 154 77 232 116 58 29 88 44 22 11 34

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,604,985 Browse Full Index Next Integer #6,604,987 →