3,072,570
2 × 3 × 5 × 23 × 61 × 73
Abundant
Even
Composite
3,072,570 factors as 2 × 3 × 5 × 23 × 61 × 73. Its 64 positive divisors give a proper-divisor sum of 4,855,494, so this integer is abundant. The Collatz stopping time is 182 steps.
Resources
Prime Factor Structure
Factorization String
2 × 3 × 5 × 23 × 61 × 73
Distinct Prime Factors
6
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
7,928,064
Proper Divisor Sum
4,855,494
Digit Sum / Digital Root
24 (Root: 6)
Adjacent Primes
#3072557 ← → #3072607
Radix Representation
| Decimal | 3072570 |
| Binary | 1011101110001000111010 (22 bits) |
| Octal | 0o13561072 |
| Hexadecimal | 0x2EE23A |
Divisor Catalog (5 of 64)
Collatz Trajectory (182 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.