2,094,435
32 × 5 × 7 × 61 × 109
Abundant
Odd
Composite
2,094,435 factors as 3^2 × 5 × 7 × 61 × 109. Its 48 positive divisors give a proper-divisor sum of 2,161,245, so this integer is abundant. The Collatz stopping time is 73 steps.
Resources
Prime Factor Structure
Factorization String
3^2 × 5 × 7 × 61 × 109
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
4,255,680
Proper Divisor Sum
2,161,245
Digit Sum / Digital Root
27 (Root: 9)
Adjacent Primes
#2094413 ← → #2094439
Radix Representation
| Decimal | 2094435 |
| Binary | 111111111010101100011 (21 bits) |
| Octal | 0o7772543 |
| Hexadecimal | 0x1FF563 |
Divisor Catalog (5 of 48)
Collatz Trajectory (73 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.