3,381,132

2² × 3 × 281761

3,381,132 factors as 2^2 × 3 × 281761. Its 12 positive divisors give a proper-divisor sum of 4,508,204, so this integer is abundant. The Collatz stopping time is 53 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 281761

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 7,889,336

Proper Divisor Sum 4,508,204

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #3381127 ← → #3381143

Radix Representation

Decimal	3381132
Binary	1100111001011110001100 (22 bits)
Octal	0o14713614
Hexadecimal	0x33978C

Divisor Catalog (12)

1 2 3 4 6 12 281,761 563,522 845,283 1,127,044 1,690,566 3,381,132

Collatz Trajectory (53 steps to reach 1)

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

3,381,132 1,690,566 845,283 2,535,850 1,267,925 3,803,776 1,901,888 950,944 475,472 237,736 118,868 59,434 29,717 89,152 44,576 22,288 11,144 5,572 2,786 1,393 4,180 2,090 1,045 3,136 1,568 784 392 196 98 49 148 74 37 112 56 28 14 7 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

← Previous Integer #3,381,131 Browse Full Index Next Integer #3,381,133 →