9,875,968

2⁹ × 19289

9,875,968 factors as 2^9 × 19289. Its 20 positive divisors give a proper-divisor sum of 9,857,702, so this integer is deficient. The Collatz stopping time is 176 steps.

Prime Factor Structure

Factorization String 2^9 × 19289

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 19,733,670

Proper Divisor Sum 9,857,702

Digit Sum / Digital Root 52 (Root: 7)

Adjacent Primes #9875941 ← → #9875977

Radix Representation

Decimal	9875968
Binary	100101101011001000000000 (24 bits)
Octal	0o45531000
Hexadecimal	0x96B200

Divisor Catalog (20)

1 2 4 8 16 32 64 128 256 512 19,289 38,578 77,156 154,312 308,624 617,248 1,234,496 2,468,992 4,937,984 9,875,968

Collatz Trajectory (176 steps to reach 1)

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

9,875,968 4,937,984 2,468,992 1,234,496 617,248 308,624 154,312 77,156 38,578 19,289 57,868 28,934 14,467 43,402 21,701 65,104 32,552 16,276 8,138 4,069 12,208 6,104 3,052 1,526 763 2,290 1,145 3,436 1,718 859 2,578 1,289 3,868 1,934 967 2,902 1,451 4,354 2,177 6,532 3,266 1,633 4,900 2,450 1,225 3,676 1,838 919 2,758 1,379 4,138 2,069 6,208 3,104 1,552 776 388 194 97 292

← Previous Integer #9,875,967 Browse Full Index Next Integer #9,875,969 →