4,636,710
2 × 33 × 5 × 13 × 1321
Abundant
Even
Composite
4,636,710 factors as 2 × 3^3 × 5 × 13 × 1321. Its 64 positive divisors give a proper-divisor sum of 8,689,050, so this integer is abundant. The Collatz stopping time is 162 steps.
Prime Factor Structure
Factorization String
2 × 3^3 × 5 × 13 × 1321
Distinct Prime Factors
5
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
64
Divisor Sum (σ)
13,325,760
Proper Divisor Sum
8,689,050
Digit Sum / Digital Root
27 (Root: 9)
Radix Representation
| Decimal | 4636710 |
| Binary | 10001101100000000100110 (23 bits) |
| Octal | 0o21540046 |
| Hexadecimal | 0x46C026 |
Divisor Catalog (60 of 64)
Collatz Trajectory (162 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.