9,566,798

2 × 4783399

9,566,798 factors as 2 × 4783399. Its 4 positive divisors give a proper-divisor sum of 4,783,402, so this integer is deficient. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 2 × 4783399

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 14,350,200

Proper Divisor Sum 4,783,402

Digit Sum / Digital Root 50 (Root: 5)

Adjacent Primes #9566797 ← → #9566807

Radix Representation

Decimal	9566798
Binary	100100011111101001001110 (24 bits)
Octal	0o44375116
Hexadecimal	0x91FA4E

Divisor Catalog (4)

1 2 4,783,399 9,566,798

Collatz Trajectory (132 steps to reach 1)

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

9,566,798 4,783,399 14,350,198 7,175,099 21,525,298 10,762,649 32,287,948 16,143,974 8,071,987 24,215,962 12,107,981 36,323,944 18,161,972 9,080,986 4,540,493 13,621,480 6,810,740 3,405,370 1,702,685 5,108,056 2,554,028 1,277,014 638,507 1,915,522 957,761 2,873,284 1,436,642 718,321 2,154,964 1,077,482 538,741 1,616,224 808,112 404,056 202,028 101,014 50,507 151,522 75,761 227,284 113,642 56,821 170,464 85,232 42,616 21,308 10,654 5,327 15,982 7,991 23,974 11,987 35,962 17,981 53,944 26,972 13,486 6,743 20,230 10,115

← Previous Integer #9,566,797 Browse Full Index Next Integer #9,566,799 →