9,485,163

3² × 31 × 33997

9,485,163 factors as 3^2 × 31 × 33997. Its 12 positive divisors give a proper-divisor sum of 4,658,005, so this integer is deficient. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 3^2 × 31 × 33997

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 14,143,168

Proper Divisor Sum 4,658,005

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9485159 ← → #9485171

Radix Representation

Decimal	9485163
Binary	100100001011101101101011 (24 bits)
Octal	0o44135553
Hexadecimal	0x90BB6B

Divisor Catalog (12)

1 3 9 31 93 279 33,997 101,991 305,973 1,053,907 3,161,721 9,485,163

Collatz Trajectory (150 steps to reach 1)

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

9,485,163 28,455,490 14,227,745 42,683,236 21,341,618 10,670,809 32,012,428 16,006,214 8,003,107 24,009,322 12,004,661 36,013,984 18,006,992 9,003,496 4,501,748 2,250,874 1,125,437 3,376,312 1,688,156 844,078 422,039 1,266,118 633,059 1,899,178 949,589 2,848,768 1,424,384 712,192 356,096 178,048 89,024 44,512 22,256 11,128 5,564 2,782 1,391 4,174 2,087 6,262 3,131 9,394 4,697 14,092 7,046 3,523 10,570 5,285 15,856 7,928 3,964 1,982 991 2,974 1,487 4,462 2,231 6,694 3,347 10,042

← Previous Integer #9,485,162 Browse Full Index Next Integer #9,485,164 →