770,286
2 × 3 × 112 × 1061
Abundant
Even
Composite
770,286 factors as 2 × 3 × 11^2 × 1061. Its 24 positive divisors give a proper-divisor sum of 924,666, so this integer is abundant. The Collatz stopping time is 48 steps.
Prime Factor Structure
Factorization String
2 × 3 × 11^2 × 1061
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
1,694,952
Proper Divisor Sum
924,666
Digit Sum / Digital Root
30 (Root: 3)
Radix Representation
| Decimal | 770286 |
| Binary | 10111100000011101110 (20 bits) |
| Octal | 0o2740356 |
| Hexadecimal | 0xBC0EE |
Divisor Catalog (24)
Collatz Trajectory (48 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.
No other profiles in this collection.