6,447,762
2 × 35 × 13267
Abundant
Even
Composite
6,447,762 factors as 2 × 3^5 × 13267. Its 24 positive divisors give a proper-divisor sum of 8,040,894, so this integer is abundant. The Collatz stopping time is 116 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3^5 × 13267
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
24
Divisor Sum (σ)
14,488,656
Proper Divisor Sum
8,040,894
Digit Sum / Digital Root
36 (Root: 9)
Adjacent Primes
#6447757 ← → #6447767
Radix Representation
| Decimal | 6447762 |
| Binary | 11000100110001010010010 (23 bits) |
| Octal | 0o30461222 |
| Hexadecimal | 0x626292 |
Divisor Catalog (5 of 24)
Collatz Trajectory (116 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.