6,105,852

2² × 3² × 169607

6,105,852 factors as 2^2 × 3^2 × 169607. Its 18 positive divisors give a proper-divisor sum of 9,328,476, so this integer is abundant. The Collatz stopping time is 258 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 169607

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 18

Divisor Sum (σ) 15,434,328

Proper Divisor Sum 9,328,476

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #6105829 ← → #6105877

Radix Representation

Decimal	6105852
Binary	10111010010101011111100 (23 bits)
Octal	0o27225374
Hexadecimal	0x5D2AFC

Divisor Catalog (18)

1 2 3 4 6 9 12 18 36 169,607 339,214 508,821 678,428 1,017,642 1,526,463 2,035,284 3,052,926 6,105,852

Collatz Trajectory (258 steps to reach 1)

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

6,105,852 3,052,926 1,526,463 4,579,390 2,289,695 6,869,086 3,434,543 10,303,630 5,151,815 15,455,446 7,727,723 23,183,170 11,591,585 34,774,756 17,387,378 8,693,689 26,081,068 13,040,534 6,520,267 19,560,802 9,780,401 29,341,204 14,670,602 7,335,301 22,005,904 11,002,952 5,501,476 2,750,738 1,375,369 4,126,108 2,063,054 1,031,527 3,094,582 1,547,291 4,641,874 2,320,937 6,962,812 3,481,406 1,740,703 5,222,110 2,611,055 7,833,166 3,916,583 11,749,750 5,874,875 17,624,626 8,812,313 26,436,940 13,218,470 6,609,235 19,827,706 9,913,853 29,741,560 14,870,780 7,435,390 3,717,695 11,153,086 5,576,543 16,729,630 8,364,815

← Previous Integer #6,105,851 Browse Full Index Next Integer #6,105,853 →