3,189,366

2 × 3² × 167 × 1061

3,189,366 factors as 2 × 3^2 × 167 × 1061. Its 24 positive divisors give a proper-divisor sum of 3,768,858, so this integer is abundant. The Collatz stopping time is 71 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 167 × 1061

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 6,958,224

Proper Divisor Sum 3,768,858

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #3189343 ← → #3189371

Radix Representation

Decimal	3189366
Binary	1100001010101001110110 (22 bits)
Octal	0o14125166
Hexadecimal	0x30AA76

Divisor Catalog (24)

Collatz Trajectory (71 steps to reach 1)

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

3,189,366 1,594,683 4,784,050 2,392,025 7,176,076 3,588,038 1,794,019 5,382,058 2,691,029 8,073,088 4,036,544 2,018,272 1,009,136 504,568 252,284 126,142 63,071 189,214 94,607 283,822 141,911 425,734 212,867 638,602 319,301 957,904 478,952 239,476 119,738 59,869 179,608 89,804 44,902 22,451 67,354 33,677 101,032 50,516 25,258 12,629 37,888 18,944 9,472 4,736 2,368 1,184 592 296 148 74 37 112 56 28 14 7 22 11 34 17

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,189,365 Browse Full Index Next Integer #3,189,367 →