6,086,466

2 × 3² × 338137

6,086,466 factors as 2 × 3^2 × 338137. Its 12 positive divisors give a proper-divisor sum of 7,100,916, so this integer is abundant. The Collatz stopping time is 227 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 338137

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 13,187,382

Proper Divisor Sum 7,100,916

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #6086461 ← → #6086471

Radix Representation

Decimal	6086466
Binary	10111001101111101000010 (23 bits)
Octal	0o27157502
Hexadecimal	0x5CDF42

Divisor Catalog (12)

1 2 3 6 9 18 338,137 676,274 1,014,411 2,028,822 3,043,233 6,086,466

Collatz Trajectory (227 steps to reach 1)

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

6,086,466 3,043,233 9,129,700 4,564,850 2,282,425 6,847,276 3,423,638 1,711,819 5,135,458 2,567,729 7,703,188 3,851,594 1,925,797 5,777,392 2,888,696 1,444,348 722,174 361,087 1,083,262 541,631 1,624,894 812,447 2,437,342 1,218,671 3,656,014 1,828,007 5,484,022 2,742,011 8,226,034 4,113,017 12,339,052 6,169,526 3,084,763 9,254,290 4,627,145 13,881,436 6,940,718 3,470,359 10,411,078 5,205,539 15,616,618 7,808,309 23,424,928 11,712,464 5,856,232 2,928,116 1,464,058 732,029 2,196,088 1,098,044 549,022 274,511 823,534 411,767 1,235,302 617,651 1,852,954 926,477 2,779,432 1,389,716

← Previous Integer #6,086,465 Browse Full Index Next Integer #6,086,467 →