9,839,882

2 × 13 × 263 × 1439

9,839,882 factors as 2 × 13 × 263 × 1439. Its 16 positive divisors give a proper-divisor sum of 6,126,838, so this integer is deficient. The Collatz stopping time is 282 steps.

Prime Factor Structure

Factorization String 2 × 13 × 263 × 1439

Distinct Prime Factors 4

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 15,966,720

Proper Divisor Sum 6,126,838

Digit Sum / Digital Root 47 (Root: 2)

Adjacent Primes #9839857 ← → #9839887

Radix Representation

Decimal	9839882
Binary	100101100010010100001010 (24 bits)
Octal	0o45422412
Hexadecimal	0x96250A

Divisor Catalog (16)

1 2 13 26 263 526 1,439 2,878 3,419 6,838 18,707 37,414 378,457 756,914 4,919,941 9,839,882

Collatz Trajectory (282 steps to reach 1)

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

9,839,882 4,919,941 14,759,824 7,379,912 3,689,956 1,844,978 922,489 2,767,468 1,383,734 691,867 2,075,602 1,037,801 3,113,404 1,556,702 778,351 2,335,054 1,167,527 3,502,582 1,751,291 5,253,874 2,626,937 7,880,812 3,940,406 1,970,203 5,910,610 2,955,305 8,865,916 4,432,958 2,216,479 6,649,438 3,324,719 9,974,158 4,987,079 14,961,238 7,480,619 22,441,858 11,220,929 33,662,788 16,831,394 8,415,697 25,247,092 12,623,546 6,311,773 18,935,320 9,467,660 4,733,830 2,366,915 7,100,746 3,550,373 10,651,120 5,325,560 2,662,780 1,331,390 665,695 1,997,086 998,543 2,995,630 1,497,815 4,493,446 2,246,723

← Previous Integer #9,839,881 Browse Full Index Next Integer #9,839,883 →