4,889,282

2 × 307 × 7963

4,889,282 factors as 2 × 307 × 7963. Its 8 positive divisors give a proper-divisor sum of 2,469,454, so this integer is deficient. The Collatz stopping time is 61 steps.

Prime Factor Structure

Factorization String 2 × 307 × 7963

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 7,358,736

Proper Divisor Sum 2,469,454

Digit Sum / Digital Root 41 (Root: 5)

Adjacent Primes #4889279 ← → #4889293

Radix Representation

Decimal	4889282
Binary	10010101001101011000010 (23 bits)
Octal	0o22515302
Hexadecimal	0x4A9AC2

Divisor Catalog (8)

1 2 307 614 7,963 15,926 2,444,641 4,889,282

Collatz Trajectory (61 steps to reach 1)

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

4,889,282 2,444,641 7,333,924 3,666,962 1,833,481 5,500,444 2,750,222 1,375,111 4,125,334 2,062,667 6,188,002 3,094,001 9,282,004 4,641,002 2,320,501 6,961,504 3,480,752 1,740,376 870,188 435,094 217,547 652,642 326,321 978,964 489,482 244,741 734,224 367,112 183,556 91,778 45,889 137,668 68,834 34,417 103,252 51,626 25,813 77,440 38,720 19,360 9,680 4,840 2,420 1,210 605 1,816 908 454 227 682 341 1,024 512 256 128 64 32 16 8 4

← Previous Integer #4,889,281 Browse Full Index Next Integer #4,889,283 →