9,587,398

2 × 2141 × 2239

9,587,398 factors as 2 × 2141 × 2239. Its 8 positive divisors give a proper-divisor sum of 4,806,842, so this integer is deficient. The Collatz stopping time is 145 steps.

Prime Factor Structure

Factorization String 2 × 2141 × 2239

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 14,394,240

Proper Divisor Sum 4,806,842

Digit Sum / Digital Root 49 (Root: 4)

Adjacent Primes #9587393 ← → #9587407

Radix Representation

Decimal	9587398
Binary	100100100100101011000110 (24 bits)
Octal	0o44445306
Hexadecimal	0x924AC6

Divisor Catalog (8)

1 2 2,141 2,239 4,282 4,478 4,793,699 9,587,398

Collatz Trajectory (145 steps to reach 1)

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

9,587,398 4,793,699 14,381,098 7,190,549 21,571,648 10,785,824 5,392,912 2,696,456 1,348,228 674,114 337,057 1,011,172 505,586 252,793 758,380 379,190 189,595 568,786 284,393 853,180 426,590 213,295 639,886 319,943 959,830 479,915 1,439,746 719,873 2,159,620 1,079,810 539,905 1,619,716 809,858 404,929 1,214,788 607,394 303,697 911,092 455,546 227,773 683,320 341,660 170,830 85,415 256,246 128,123 384,370 192,185 576,556 288,278 144,139 432,418 216,209 648,628 324,314 162,157 486,472 243,236 121,618 60,809

← Previous Integer #9,587,397 Browse Full Index Next Integer #9,587,399 →