1,451,400

2³ × 3 × 5² × 41 × 59

1,451,400 factors as 2^3 × 3 × 5^2 × 41 × 59. Its 96 positive divisors give a proper-divisor sum of 3,235,800, so this integer is abundant. The Collatz stopping time is 212 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5^2 × 41 × 59

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 4,687,200

Proper Divisor Sum 3,235,800

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #1451393 ← → #1451423

Radix Representation

Decimal	1451400
Binary	101100010010110001000 (21 bits)
Octal	0o5422610
Hexadecimal	0x162588

Divisor Catalog (60 of 96)

1 2 3 4 5 6 8 10 12 15 20 24 25 30 40 41 50 59 60 75 82 100 118 120 123 150 164 177 200 205 236 246 295 300 328 354 410 472 492 590 600 615 708 820 885 984 1,025 1,180 1,230 1,416 1,475 1,640 1,770 2,050 2,360 2,419 2,460 2,950 3,075 3,540

Collatz Trajectory (212 steps to reach 1)

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

1,451,400 725,700 362,850 181,425 544,276 272,138 136,069 408,208 204,104 102,052 51,026 25,513 76,540 38,270 19,135 57,406 28,703 86,110 43,055 129,166 64,583 193,750 96,875 290,626 145,313 435,940 217,970 108,985 326,956 163,478 81,739 245,218 122,609 367,828 183,914 91,957 275,872 137,936 68,968 34,484 17,242 8,621 25,864 12,932 6,466 3,233 9,700 4,850 2,425 7,276 3,638 1,819 5,458 2,729 8,188 4,094 2,047 6,142 3,071 9,214

← Previous Integer #1,451,399 Browse Full Index Next Integer #1,451,401 →