9,255,104

2⁶ × 144611

9,255,104 factors as 2^6 × 144611. Its 14 positive divisors give a proper-divisor sum of 9,110,620, so this integer is deficient. The Collatz stopping time is 49 steps.

Prime Factor Structure

Factorization String 2^6 × 144611

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 14

Divisor Sum (σ) 18,365,724

Proper Divisor Sum 9,110,620

Digit Sum / Digital Root 26 (Root: 8)

Adjacent Primes #9255101 ← → #9255119

Radix Representation

Decimal	9255104
Binary	100011010011100011000000 (24 bits)
Octal	0o43234300
Hexadecimal	0x8D38C0

Divisor Catalog (14)

1 2 4 8 16 32 64 144,611 289,222 578,444 1,156,888 2,313,776 4,627,552 9,255,104

Collatz Trajectory (49 steps to reach 1)

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

9,255,104 4,627,552 2,313,776 1,156,888 578,444 289,222 144,611 433,834 216,917 650,752 325,376 162,688 81,344 40,672 20,336 10,168 5,084 2,542 1,271 3,814 1,907 5,722 2,861 8,584 4,292 2,146 1,073 3,220 1,610 805 2,416 1,208 604 302 151 454 227 682 341 1,024 512 256 128 64 32 16 8 4 2 1

← Previous Integer #9,255,103 Browse Full Index Next Integer #9,255,105 →