9,286,359

3 × 3095453

9,286,359 factors as 3 × 3095453. Its 4 positive divisors give a proper-divisor sum of 3,095,457, so this integer is deficient. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 3 × 3095453

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 12,381,816

Proper Divisor Sum 3,095,457

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #9286327 ← → #9286363

Radix Representation

Decimal	9286359
Binary	100011011011001011010111 (24 bits)
Octal	0o43331327
Hexadecimal	0x8DB2D7

Divisor Catalog (4)

1 3 3,095,453 9,286,359

Collatz Trajectory (101 steps to reach 1)

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

9,286,359 27,859,078 13,929,539 41,788,618 20,894,309 62,682,928 31,341,464 15,670,732 7,835,366 3,917,683 11,753,050 5,876,525 17,629,576 8,814,788 4,407,394 2,203,697 6,611,092 3,305,546 1,652,773 4,958,320 2,479,160 1,239,580 619,790 309,895 929,686 464,843 1,394,530 697,265 2,091,796 1,045,898 522,949 1,568,848 784,424 392,212 196,106 98,053 294,160 147,080 73,540 36,770 18,385 55,156 27,578 13,789 41,368 20,684 10,342 5,171 15,514 7,757 23,272 11,636 5,818 2,909 8,728 4,364 2,182 1,091 3,274 1,637

← Previous Integer #9,286,358 Browse Full Index Next Integer #9,286,360 →