1,620,000
25 × 34 × 54
Abundant
Even
Composite
1,620,000 factors as 2^5 × 3^4 × 5^4. Its 150 positive divisors give a proper-divisor sum of 4,333,563, so this integer is abundant. The Collatz stopping time is 62 steps.
Prime Factor Structure
Factorization String
2^5 × 3^4 × 5^4
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
150
Divisor Sum (σ)
5,953,563
Proper Divisor Sum
4,333,563
Digit Sum / Digital Root
9 (Root: 9)
Radix Representation
| Decimal | 1620000 |
| Binary | 110001011100000100000 (21 bits) |
| Octal | 0o6134040 |
| Hexadecimal | 0x18B820 |
Divisor Catalog (60 of 150)
Collatz Trajectory (62 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
More profiles
Browse other published profiles and their separate link collections.