15,394,016
25 × 11 × 101 × 433
Abundant
Even
Composite
15,394,016 factors as 2^5 × 11 × 101 × 433. Its 48 positive divisors give a proper-divisor sum of 18,072,592, so this integer is abundant. The Collatz stopping time is 218 steps.
Prime Factor Structure
Factorization String
2^5 × 11 × 101 × 433
Distinct Prime Factors
4
Square Status
No
Abundance Measure
Abundant
Analytical Properties
Total Divisors
48
Divisor Sum (σ)
33,466,608
Proper Divisor Sum
18,072,592
Digit Sum / Digital Root
29 (Root: 2)
Radix Representation
| Decimal | 15394016 |
| Binary | 111010101110010011100000 (24 bits) |
| Octal | 0o72562340 |
| Hexadecimal | 0xEAE4E0 |
Divisor Catalog (48)
Collatz Trajectory (218 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.