9,058,896

2⁴ × 3² × 7 × 11 × 19 × 43

9,058,896 factors as 2^4 × 3^2 × 7 × 11 × 19 × 43. Its 240 positive divisors give a proper-divisor sum of 24,986,544, so this integer is abundant. The Collatz stopping time is 181 steps.

Prime Factor Structure

Factorization String 2^4 × 3^2 × 7 × 11 × 19 × 43

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 240

Divisor Sum (σ) 34,045,440

Proper Divisor Sum 24,986,544

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #9058891 ← → #9058901

Radix Representation

Decimal	9058896
Binary	100010100011101001010000 (24 bits)
Octal	0o42435120
Hexadecimal	0x8A3A50

Divisor Catalog (60 of 240)

1 2 3 4 6 7 8 9 11 12 14 16 18 19 21 22 24 28 33 36 38 42 43 44 48 56 57 63 66 72 76 77 84 86 88 99 112 114 126 129 132 133 144 152 154 168 171 172 176 198 209 228 231 252 258 264 266 301 304 308

Collatz Trajectory (181 steps to reach 1)

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

9,058,896 4,529,448 2,264,724 1,132,362 566,181 1,698,544 849,272 424,636 212,318 106,159 318,478 159,239 477,718 238,859 716,578 358,289 1,074,868 537,434 268,717 806,152 403,076 201,538 100,769 302,308 151,154 75,577 226,732 113,366 56,683 170,050 85,025 255,076 127,538 63,769 191,308 95,654 47,827 143,482 71,741 215,224 107,612 53,806 26,903 80,710 40,355 121,066 60,533 181,600 90,800 45,400 22,700 11,350 5,675 17,026 8,513 25,540 12,770 6,385 19,156 9,578

← Previous Integer #9,058,895 Browse Full Index Next Integer #9,058,897 →