49,638,400
210 × 52 × 7 × 277
Abundant
Even
Composite
49,638,400 factors as 2^10 × 5^2 × 7 × 277. Its 132 positive divisors give a proper-divisor sum of 91,489,968, so this integer is abundant. The Collatz stopping time is 261 steps.
Prime Factor Structure
Factorization String
2^10 × 5^2 × 7 × 277
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
132
Divisor Sum (σ)
141,128,368
Proper Divisor Sum
91,489,968
Digit Sum / Digital Root
34 (Root: 7)
Radix Representation
| Decimal | 49638400 |
| Binary | 10111101010110110000000000 (26 bits) |
| Octal | 0o275266000 |
| Hexadecimal | 0x2F56C00 |
Divisor Catalog (60 of 132)
Collatz Trajectory (261 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.