4,498,518

2 × 3 × 823 × 911

4,498,518 factors as 2 × 3 × 823 × 911. Its 16 positive divisors give a proper-divisor sum of 4,519,338, so this integer is abundant. The Collatz stopping time is 149 steps.

Prime Factor Structure

Factorization String 2 × 3 × 823 × 911

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,017,856

Proper Divisor Sum 4,519,338

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #4498513 ← → #4498553

Radix Representation

Decimal	4498518
Binary	10001001010010001010110 (23 bits)
Octal	0o21122126
Hexadecimal	0x44A456

Divisor Catalog (16)

1 2 3 6 823 911 1,646 1,822 2,469 2,733 4,938 5,466 749,753 1,499,506 2,249,259 4,498,518

Collatz Trajectory (149 steps to reach 1)

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

4,498,518 2,249,259 6,747,778 3,373,889 10,121,668 5,060,834 2,530,417 7,591,252 3,795,626 1,897,813 5,693,440 2,846,720 1,423,360 711,680 355,840 177,920 88,960 44,480 22,240 11,120 5,560 2,780 1,390 695 2,086 1,043 3,130 1,565 4,696 2,348 1,174 587 1,762 881 2,644 1,322 661 1,984 992 496 248 124 62 31 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,498,517 Browse Full Index Next Integer #4,498,519 →