4,445,400

2³ × 3 × 5² × 31 × 239

4,445,400 factors as 2^3 × 3 × 5^2 × 31 × 239. Its 96 positive divisors give a proper-divisor sum of 9,839,400, so this integer is abundant. The Collatz stopping time is 141 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5^2 × 31 × 239

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 14,284,800

Proper Divisor Sum 9,839,400

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #4445393 ← → #4445429

Radix Representation

Decimal	4445400
Binary	10000111101010011011000 (23 bits)
Octal	0o20752330
Hexadecimal	0x43D4D8

Divisor Catalog (60 of 96)

1 2 3 4 5 6 8 10 12 15 20 24 25 30 31 40 50 60 62 75 93 100 120 124 150 155 186 200 239 248 300 310 372 465 478 600 620 717 744 775 930 956 1,195 1,240 1,434 1,550 1,860 1,912 2,325 2,390 2,868 3,100 3,585 3,720 4,650 4,780 5,736 5,975 6,200 7,170

Collatz Trajectory (141 steps to reach 1)

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

4,445,400 2,222,700 1,111,350 555,675 1,667,026 833,513 2,500,540 1,250,270 625,135 1,875,406 937,703 2,813,110 1,406,555 4,219,666 2,109,833 6,329,500 3,164,750 1,582,375 4,747,126 2,373,563 7,120,690 3,560,345 10,681,036 5,340,518 2,670,259 8,010,778 4,005,389 12,016,168 6,008,084 3,004,042 1,502,021 4,506,064 2,253,032 1,126,516 563,258 281,629 844,888 422,444 211,222 105,611 316,834 158,417 475,252 237,626 118,813 356,440 178,220 89,110 44,555 133,666 66,833 200,500 100,250 50,125 150,376 75,188 37,594 18,797 56,392 28,196

← Previous Integer #4,445,399 Browse Full Index Next Integer #4,445,401 →