1,451,100
22 × 3 × 52 × 7 × 691
Abundant
Even
Composite
1,451,100 factors as 2^2 × 3 × 5^2 × 7 × 691. Its 72 positive divisors give a proper-divisor sum of 3,354,148, so this integer is abundant. The Collatz stopping time is 124 steps.
Prime Factor Structure
Factorization String
2^2 × 3 × 5^2 × 7 × 691
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
72
Divisor Sum (σ)
4,805,248
Proper Divisor Sum
3,354,148
Digit Sum / Digital Root
12 (Root: 3)
Adjacent Primes
#1451083 ← → #1451119
Radix Representation
| Decimal | 1451100 |
| Binary | 101100010010001011100 (21 bits) |
| Octal | 0o5422134 |
| Hexadecimal | 0x16245C |
Divisor Catalog (60 of 72)
Collatz Trajectory (124 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):