3,620,100
22 × 3 × 52 × 11 × 1097
Abundant
Even
Composite
3,620,100 factors as 2^2 × 3 × 5^2 × 11 × 1097. Its 72 positive divisors give a proper-divisor sum of 7,816,668, so this integer is abundant. The Collatz stopping time is 234 steps.
Prime Factor Structure
Factorization String
2^2 × 3 × 5^2 × 11 × 1097
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
72
Divisor Sum (σ)
11,436,768
Proper Divisor Sum
7,816,668
Digit Sum / Digital Root
12 (Root: 3)
Adjacent Primes
#3620093 ← → #3620119
Radix Representation
| Decimal | 3620100 |
| Binary | 1101110011110100000100 (22 bits) |
| Octal | 0o15636404 |
| Hexadecimal | 0x373D04 |
Divisor Catalog (60 of 72)
Collatz Trajectory (234 steps to reach 1)
Iterative sequence n → n/2 (if even) or 3n+1 (if odd):