3,039,000
23 × 3 × 53 × 1013
Abundant
Even
Composite
3,039,000 factors as 2^3 × 3 × 5^3 × 1013. Its 64 positive divisors give a proper-divisor sum of 6,452,040, so this integer is abundant. The Collatz stopping time is 107 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 5^3 × 1013
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
9,491,040
Proper Divisor Sum
6,452,040
Digit Sum / Digital Root
15 (Root: 6)
Adjacent Primes
#3038999 ← → #3039011
Radix Representation
| Decimal | 3039000 |
| Binary | 1011100101111100011000 (22 bits) |
| Octal | 0o13457430 |
| Hexadecimal | 0x2E5F18 |
Divisor Catalog (5 of 64)
Collatz Trajectory (107 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.