9,569,264

2⁴ × 598079

9,569,264 factors as 2^4 × 598079. Its 10 positive divisors give a proper-divisor sum of 8,971,216, so this integer is deficient. The Collatz stopping time is 194 steps.

Prime Factor Structure

Factorization String 2^4 × 598079

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 10

Divisor Sum (σ) 18,540,480

Proper Divisor Sum 8,971,216

Digit Sum / Digital Root 41 (Root: 5)

Adjacent Primes #9569257 ← → #9569299

Radix Representation

Decimal	9569264
Binary	100100100000001111110000 (24 bits)
Octal	0o44401760
Hexadecimal	0x9203F0

Divisor Catalog (10)

1 2 4 8 16 598,079 1,196,158 2,392,316 4,784,632 9,569,264

Collatz Trajectory (194 steps to reach 1)

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

9,569,264 4,784,632 2,392,316 1,196,158 598,079 1,794,238 897,119 2,691,358 1,345,679 4,037,038 2,018,519 6,055,558 3,027,779 9,083,338 4,541,669 13,625,008 6,812,504 3,406,252 1,703,126 851,563 2,554,690 1,277,345 3,832,036 1,916,018 958,009 2,874,028 1,437,014 718,507 2,155,522 1,077,761 3,233,284 1,616,642 808,321 2,424,964 1,212,482 606,241 1,818,724 909,362 454,681 1,364,044 682,022 341,011 1,023,034 511,517 1,534,552 767,276 383,638 191,819 575,458 287,729 863,188 431,594 215,797 647,392 323,696 161,848 80,924 40,462 20,231 60,694

← Previous Integer #9,569,263 Browse Full Index Next Integer #9,569,265 →