3,197,046

2 × 3 × 23 × 23167

3,197,046 factors as 2 × 3 × 23 × 23167. Its 16 positive divisors give a proper-divisor sum of 3,475,338, so this integer is abundant. The Collatz stopping time is 195 steps.

Prime Factor Structure

Factorization String 2 × 3 × 23 × 23167

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 6,672,384

Proper Divisor Sum 3,475,338

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3197027 ← → #3197063

Radix Representation

Decimal	3197046
Binary	1100001100100001110110 (22 bits)
Octal	0o14144166
Hexadecimal	0x30C876

Divisor Catalog (16)

1 2 3 6 23 46 69 138 23,167 46,334 69,501 139,002 532,841 1,065,682 1,598,523 3,197,046

Collatz Trajectory (195 steps to reach 1)

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

3,197,046 1,598,523 4,795,570 2,397,785 7,193,356 3,596,678 1,798,339 5,395,018 2,697,509 8,092,528 4,046,264 2,023,132 1,011,566 505,783 1,517,350 758,675 2,276,026 1,138,013 3,414,040 1,707,020 853,510 426,755 1,280,266 640,133 1,920,400 960,200 480,100 240,050 120,025 360,076 180,038 90,019 270,058 135,029 405,088 202,544 101,272 50,636 25,318 12,659 37,978 18,989 56,968 28,484 14,242 7,121 21,364 10,682 5,341 16,024 8,012 4,006 2,003 6,010 3,005 9,016 4,508 2,254 1,127 3,382

← Previous Integer #3,197,045 Browse Full Index Next Integer #3,197,047 →