4,497,592

2³ × 11 × 51109

4,497,592 factors as 2^3 × 11 × 51109. Its 16 positive divisors give a proper-divisor sum of 4,702,208, so this integer is abundant. The Collatz stopping time is 136 steps.

Prime Factor Structure

Factorization String 2^3 × 11 × 51109

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,199,800

Proper Divisor Sum 4,702,208

Digit Sum / Digital Root 40 (Root: 4)

Adjacent Primes #4497589 ← → #4497601

Radix Representation

Decimal	4497592
Binary	10001001010000010111000 (23 bits)
Octal	0o21120270
Hexadecimal	0x44A0B8

Divisor Catalog (16)

1 2 4 8 11 22 44 88 51,109 102,218 204,436 408,872 562,199 1,124,398 2,248,796 4,497,592

Collatz Trajectory (136 steps to reach 1)

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

4,497,592 2,248,796 1,124,398 562,199 1,686,598 843,299 2,529,898 1,264,949 3,794,848 1,897,424 948,712 474,356 237,178 118,589 355,768 177,884 88,942 44,471 133,414 66,707 200,122 100,061 300,184 150,092 75,046 37,523 112,570 56,285 168,856 84,428 42,214 21,107 63,322 31,661 94,984 47,492 23,746 11,873 35,620 17,810 8,905 26,716 13,358 6,679 20,038 10,019 30,058 15,029 45,088 22,544 11,272 5,636 2,818 1,409 4,228 2,114 1,057 3,172 1,586 793

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,497,591 Browse Full Index Next Integer #4,497,593 →