4,497,232

2⁴ × 31 × 9067

4,497,232 factors as 2^4 × 31 × 9067. Its 20 positive divisors give a proper-divisor sum of 4,498,224, so this integer is abundant. The Collatz stopping time is 87 steps.

Prime Factor Structure

Factorization String 2^4 × 31 × 9067

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 8,995,456

Proper Divisor Sum 4,498,224

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #4497223 ← → #4497247

Radix Representation

Decimal	4497232
Binary	10001001001111101010000 (23 bits)
Octal	0o21117520
Hexadecimal	0x449F50

Divisor Catalog (20)

Collatz Trajectory (87 steps to reach 1)

Iterative sequence n → n/2 (if even) or 3n+1 (if odd):

4,497,232 2,248,616 1,124,308 562,154 281,077 843,232 421,616 210,808 105,404 52,702 26,351 79,054 39,527 118,582 59,291 177,874 88,937 266,812 133,406 66,703 200,110 100,055 300,166 150,083 450,250 225,125 675,376 337,688 168,844 84,422 42,211 126,634 63,317 189,952 94,976 47,488 23,744 11,872 5,936 2,968 1,484 742 371 1,114 557 1,672 836 418 209 628 314 157 472 236 118 59 178 89 268 134

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,497,231 Browse Full Index Next Integer #4,497,233 →