13,000,000
26 × 56 × 13
Abundant
Even
Composite
13,000,000 factors as 2^6 × 5^6 × 13. Its 98 positive divisors give a proper-divisor sum of 21,726,118, so this integer is abundant. The Collatz stopping time is 47 steps.
Prime Factor Structure
Factorization String
2^6 × 5^6 × 13
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
98
Divisor Sum (σ)
34,726,118
Proper Divisor Sum
21,726,118
Digit Sum / Digital Root
4 (Root: 4)
Radix Representation
| Decimal | 13000000 |
| Binary | 110001100101110101000000 (24 bits) |
| Octal | 0o61456500 |
| Hexadecimal | 0xC65D40 |
Divisor Catalog (60 of 98)
Collatz Trajectory (47 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.