9,656,756

2² × 157 × 15377

9,656,756 factors as 2^2 × 157 × 15377. Its 12 positive divisors give a proper-divisor sum of 7,351,312, so this integer is deficient. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2^2 × 157 × 15377

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 17,008,068

Proper Divisor Sum 7,351,312

Digit Sum / Digital Root 44 (Root: 8)

Adjacent Primes #9656753 ← → #9656783

Radix Representation

Decimal	9656756
Binary	100100110101100110110100 (24 bits)
Octal	0o44654664
Hexadecimal	0x9359B4

Divisor Catalog (12)

1 2 4 157 314 628 15,377 30,754 61,508 2,414,189 4,828,378 9,656,756

Collatz Trajectory (163 steps to reach 1)

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

9,656,756 4,828,378 2,414,189 7,242,568 3,621,284 1,810,642 905,321 2,715,964 1,357,982 678,991 2,036,974 1,018,487 3,055,462 1,527,731 4,583,194 2,291,597 6,874,792 3,437,396 1,718,698 859,349 2,578,048 1,289,024 644,512 322,256 161,128 80,564 40,282 20,141 60,424 30,212 15,106 7,553 22,660 11,330 5,665 16,996 8,498 4,249 12,748 6,374 3,187 9,562 4,781 14,344 7,172 3,586 1,793 5,380 2,690 1,345 4,036 2,018 1,009 3,028 1,514 757 2,272 1,136 568 284

← Previous Integer #9,656,755 Browse Full Index Next Integer #9,656,757 →