3,193,176

2³ × 3 × 7 × 83 × 229

3,193,176 factors as 2^3 × 3 × 7 × 83 × 229. Its 64 positive divisors give a proper-divisor sum of 6,080,424, so this integer is abundant. The Collatz stopping time is 71 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 7 × 83 × 229

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 9,273,600

Proper Divisor Sum 6,080,424

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3193171 ← → #3193187

Radix Representation

Decimal	3193176
Binary	1100001011100101011000 (22 bits)
Octal	0o14134530
Hexadecimal	0x30B958

Divisor Catalog (60 of 64)

1 2 3 4 6 7 8 12 14 21 24 28 42 56 83 84 166 168 229 249 332 458 498 581 664 687 916 996 1,162 1,374 1,603 1,743 1,832 1,992 2,324 2,748 3,206 3,486 4,648 4,809 5,496 6,412 6,972 9,618 12,824 13,944 19,007 19,236 38,014 38,472 57,021 76,028 114,042 133,049 152,056 228,084 266,098 399,147 456,168 532,196

Collatz Trajectory (71 steps to reach 1)

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

3,193,176 1,596,588 798,294 399,147 1,197,442 598,721 1,796,164 898,082 449,041 1,347,124 673,562 336,781 1,010,344 505,172 252,586 126,293 378,880 189,440 94,720 47,360 23,680 11,840 5,920 2,960 1,480 740 370 185 556 278 139 418 209 628 314 157 472 236 118 59 178 89 268 134 67 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17

← Previous Integer #3,193,175 Browse Full Index Next Integer #3,193,177 →