7,000,448
27 × 7 × 13 × 601
Abundant
Even
Composite
7,000,448 factors as 2^7 × 7 × 13 × 601. Its 64 positive divisors give a proper-divisor sum of 10,192,672, so this integer is abundant. The Collatz stopping time is 160 steps.
Resources
Prime Factor Structure
Factorization String
2^7 × 7 × 13 × 601
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
17,193,120
Proper Divisor Sum
10,192,672
Digit Sum / Digital Root
23 (Root: 5)
Adjacent Primes
#7000429 ← → #7000459
Radix Representation
| Decimal | 7000448 |
| Binary | 11010101101000110000000 (23 bits) |
| Octal | 0o32550600 |
| Hexadecimal | 0x6AD180 |
Divisor Catalog (5 of 64)
Collatz Trajectory (160 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):
Showing the first 5 trajectory entries; the stopping-time total above is unchanged.