5,470,536
23 × 3 × 103 × 2213
Abundant
Even
Composite
5,470,536 factors as 2^3 × 3 × 103 × 2213. Its 32 positive divisors give a proper-divisor sum of 8,344,824, so this integer is abundant. The Collatz stopping time is 82 steps.
Resources
Prime Factor Structure
Factorization String
2^3 × 3 × 103 × 2213
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
32
Divisor Sum (σ)
13,815,360
Proper Divisor Sum
8,344,824
Digit Sum / Digital Root
30 (Root: 3)
Adjacent Primes
#5470529 ← → #5470567
Radix Representation
| Decimal | 5470536 |
| Binary | 10100110111100101001000 (23 bits) |
| Octal | 0o24674510 |
| Hexadecimal | 0x537948 |
Divisor Catalog (5 of 32)
Collatz Trajectory (82 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.