6,841,200

2⁴ × 3 × 5² × 5701

6,841,200 factors as 2^4 × 3 × 5^2 × 5701. Its 60 positive divisors give a proper-divisor sum of 15,077,288, so this integer is abundant. The Collatz stopping time is 134 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 5^2 × 5701

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 60

Divisor Sum (σ) 21,918,488

Proper Divisor Sum 15,077,288

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #6841199 ← → #6841207

Radix Representation

Decimal	6841200
Binary	11010000110001101110000 (23 bits)
Octal	0o32061560
Hexadecimal	0x686370

Divisor Catalog (60)

1 2 3 4 5 6 8 10 12 15 16 20 24 25 30 40 48 50 60 75 80 100 120 150 200 240 300 400 600 1,200 5,701 11,402 17,103 22,804 28,505 34,206 45,608 57,010 68,412 85,515 91,216 114,020 136,824 142,525 171,030 228,040 273,648 285,050 342,060 427,575 456,080 570,100 684,120 855,150 1,140,200 1,368,240 1,710,300 2,280,400 3,420,600 6,841,200

Collatz Trajectory (134 steps to reach 1)

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

6,841,200 3,420,600 1,710,300 855,150 427,575 1,282,726 641,363 1,924,090 962,045 2,886,136 1,443,068 721,534 360,767 1,082,302 541,151 1,623,454 811,727 2,435,182 1,217,591 3,652,774 1,826,387 5,479,162 2,739,581 8,218,744 4,109,372 2,054,686 1,027,343 3,082,030 1,541,015 4,623,046 2,311,523 6,934,570 3,467,285 10,401,856 5,200,928 2,600,464 1,300,232 650,116 325,058 162,529 487,588 243,794 121,897 365,692 182,846 91,423 274,270 137,135 411,406 205,703 617,110 308,555 925,666 462,833 1,388,500 694,250 347,125 1,041,376 520,688 260,344

← Previous Integer #6,841,199 Browse Full Index Next Integer #6,841,201 →