3,393,600

2⁶ × 3 × 5² × 7 × 101

3,393,600 factors as 2^6 × 3 × 5^2 × 7 × 101. Its 168 positive divisors give a proper-divisor sum of 9,456,768, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 5^2 × 7 × 101

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 168

Divisor Sum (σ) 12,850,368

Proper Divisor Sum 9,456,768

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #3393583 ← → #3393619

Radix Representation

Decimal	3393600
Binary	1100111100100001000000 (22 bits)
Octal	0o14744100
Hexadecimal	0x33C840

Divisor Catalog (60 of 168)

1 2 3 4 5 6 7 8 10 12 14 15 16 20 21 24 25 28 30 32 35 40 42 48 50 56 60 64 70 75 80 84 96 100 101 105 112 120 140 150 160 168 175 192 200 202 210 224 240 280 300 303 320 336 350 400 404 420 448 480

Collatz Trajectory (84 steps to reach 1)

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

3,393,600 1,696,800 848,400 424,200 212,100 106,050 53,025 159,076 79,538 39,769 119,308 59,654 29,827 89,482 44,741 134,224 67,112 33,556 16,778 8,389 25,168 12,584 6,292 3,146 1,573 4,720 2,360 1,180 590 295 886 443 1,330 665 1,996 998 499 1,498 749 2,248 1,124 562 281 844 422 211 634 317 952 476 238 119 358 179 538 269 808 404 202 101

← Previous Integer #3,393,599 Browse Full Index Next Integer #3,393,601 →