9,119,256

2³ × 3 × 61 × 6229

9,119,256 factors as 2^3 × 3 × 61 × 6229. Its 32 positive divisors give a proper-divisor sum of 14,056,344, so this integer is abundant. The Collatz stopping time is 106 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 61 × 6229

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 23,175,600

Proper Divisor Sum 14,056,344

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9119251 ← → #9119263

Radix Representation

Decimal	9119256
Binary	100010110010011000011000 (24 bits)
Octal	0o42623030
Hexadecimal	0x8B2618

Divisor Catalog (32)

1 2 3 4 6 8 12 24 61 122 183 244 366 488 732 1,464 6,229 12,458 18,687 24,916 37,374 49,832 74,748 149,496 379,969 759,938 1,139,907 1,519,876 2,279,814 3,039,752 4,559,628 9,119,256

Collatz Trajectory (106 steps to reach 1)

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

9,119,256 4,559,628 2,279,814 1,139,907 3,419,722 1,709,861 5,129,584 2,564,792 1,282,396 641,198 320,599 961,798 480,899 1,442,698 721,349 2,164,048 1,082,024 541,012 270,506 135,253 405,760 202,880 101,440 50,720 25,360 12,680 6,340 3,170 1,585 4,756 2,378 1,189 3,568 1,784 892 446 223 670 335 1,006 503 1,510 755 2,266 1,133 3,400 1,700 850 425 1,276 638 319 958 479 1,438 719 2,158 1,079 3,238 1,619

← Previous Integer #9,119,255 Browse Full Index Next Integer #9,119,257 →