30,006,784
29 × 103 × 569
Abundant
Even
Composite
30,006,784 factors as 2^9 × 103 × 569. Its 40 positive divisors give a proper-divisor sum of 30,636,656, so this integer is abundant. The Collatz stopping time is 175 steps.
Prime Factor Structure
Factorization String
2^9 × 103 × 569
Distinct Prime Factors
3
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
40
Divisor Sum (σ)
60,643,440
Proper Divisor Sum
30,636,656
Digit Sum / Digital Root
28 (Root: 1)
Radix Representation
| Decimal | 30006784 |
| Binary | 1110010011101111000000000 (25 bits) |
| Octal | 0o162357000 |
| Hexadecimal | 0x1C9DE00 |
Divisor Catalog (40)
Collatz Trajectory (175 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.