9,560,968

2³ × 1195121

9,560,968 factors as 2^3 × 1195121. Its 8 positive divisors give a proper-divisor sum of 8,365,862, so this integer is deficient. The Collatz stopping time is 44 steps.

Prime Factor Structure

Factorization String 2^3 × 1195121

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 17,926,830

Proper Divisor Sum 8,365,862

Digit Sum / Digital Root 43 (Root: 7)

Adjacent Primes #9560959 ← → #9560983

Radix Representation

Decimal	9560968
Binary	100100011110001110001000 (24 bits)
Octal	0o44361610
Hexadecimal	0x91E388

Divisor Catalog (8)

1 2 4 8 1,195,121 2,390,242 4,780,484 9,560,968

Collatz Trajectory (44 steps to reach 1)

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

9,560,968 4,780,484 2,390,242 1,195,121 3,585,364 1,792,682 896,341 2,689,024 1,344,512 672,256 336,128 168,064 84,032 42,016 21,008 10,504 5,252 2,626 1,313 3,940 1,970 985 2,956 1,478 739 2,218 1,109 3,328 1,664 832 416 208 104 52 26 13 40 20 10 5 16 8 4 2 1

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