6,591,678

2 × 3 × 1098613

6,591,678 factors as 2 × 3 × 1098613. Its 8 positive divisors give a proper-divisor sum of 6,591,690, so this integer is abundant. The Collatz stopping time is 147 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1098613

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,183,368

Proper Divisor Sum 6,591,690

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #6591677 ← → #6591679

Radix Representation

Decimal	6591678
Binary	11001001001010010111110 (23 bits)
Octal	0o31112276
Hexadecimal	0x6494BE

Divisor Catalog (8)

1 2 3 6 1,098,613 2,197,226 3,295,839 6,591,678

Collatz Trajectory (147 steps to reach 1)

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

6,591,678 3,295,839 9,887,518 4,943,759 14,831,278 7,415,639 22,246,918 11,123,459 33,370,378 16,685,189 50,055,568 25,027,784 12,513,892 6,256,946 3,128,473 9,385,420 4,692,710 2,346,355 7,039,066 3,519,533 10,558,600 5,279,300 2,639,650 1,319,825 3,959,476 1,979,738 989,869 2,969,608 1,484,804 742,402 371,201 1,113,604 556,802 278,401 835,204 417,602 208,801 626,404 313,202 156,601 469,804 234,902 117,451 352,354 176,177 528,532 264,266 132,133 396,400 198,200 99,100 49,550 24,775 74,326 37,163 111,490 55,745 167,236 83,618 41,809

← Previous Integer #6,591,677 Browse Full Index Next Integer #6,591,679 →