4,321,600

2⁶ × 5² × 37 × 73

4,321,600 factors as 2^6 × 5^2 × 37 × 73. Its 84 positive divisors give a proper-divisor sum of 6,749,244, so this integer is abundant. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 2^6 × 5^2 × 37 × 73

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 84

Divisor Sum (σ) 11,070,844

Proper Divisor Sum 6,749,244

Digit Sum / Digital Root 16 (Root: 7)

Adjacent Primes #4321529 ← → #4321601

Radix Representation

Decimal	4321600
Binary	10000011111000101000000 (23 bits)
Octal	0o20370500
Hexadecimal	0x41F140

Divisor Catalog (60 of 84)

1 2 4 5 8 10 16 20 25 32 37 40 50 64 73 74 80 100 146 148 160 185 200 292 296 320 365 370 400 584 592 730 740 800 925 1,168 1,184 1,460 1,480 1,600 1,825 1,850 2,336 2,368 2,701 2,920 2,960 3,650 3,700 4,672 5,402 5,840 5,920 7,300 7,400 10,804 11,680 11,840 13,505 14,600

Collatz Trajectory (92 steps to reach 1)

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

4,321,600 2,160,800 1,080,400 540,200 270,100 135,050 67,525 202,576 101,288 50,644 25,322 12,661 37,984 18,992 9,496 4,748 2,374 1,187 3,562 1,781 5,344 2,672 1,336 668 334 167 502 251 754 377 1,132 566 283 850 425 1,276 638 319 958 479 1,438 719 2,158 1,079 3,238 1,619 4,858 2,429 7,288 3,644 1,822 911 2,734 1,367 4,102 2,051 6,154 3,077 9,232 4,616

← Previous Integer #4,321,599 Browse Full Index Next Integer #4,321,601 →