9,216,558

2 × 3³ × 13 × 19 × 691

9,216,558 factors as 2 × 3^3 × 13 × 19 × 691. Its 64 positive divisors give a proper-divisor sum of 14,034,642, so this integer is abundant. The Collatz stopping time is 256 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 13 × 19 × 691

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 23,251,200

Proper Divisor Sum 14,034,642

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #9216547 ← → #9216593

Radix Representation

Decimal	9216558
Binary	100011001010001000101110 (24 bits)
Octal	0o43121056
Hexadecimal	0x8CA22E

Divisor Catalog (60 of 64)

1 2 3 6 9 13 18 19 26 27 38 39 54 57 78 114 117 171 234 247 342 351 494 513 691 702 741 1,026 1,382 1,482 2,073 2,223 4,146 4,446 6,219 6,669 8,983 12,438 13,129 13,338 17,966 18,657 26,258 26,949 37,314 39,387 53,898 78,774 80,847 118,161 161,694 170,677 236,322 242,541 341,354 354,483 485,082 512,031 708,966 1,024,062

Collatz Trajectory (256 steps to reach 1)

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

9,216,558 4,608,279 13,824,838 6,912,419 20,737,258 10,368,629 31,105,888 15,552,944 7,776,472 3,888,236 1,944,118 972,059 2,916,178 1,458,089 4,374,268 2,187,134 1,093,567 3,280,702 1,640,351 4,921,054 2,460,527 7,381,582 3,690,791 11,072,374 5,536,187 16,608,562 8,304,281 24,912,844 12,456,422 6,228,211 18,684,634 9,342,317 28,026,952 14,013,476 7,006,738 3,503,369 10,510,108 5,255,054 2,627,527 7,882,582 3,941,291 11,823,874 5,911,937 17,735,812 8,867,906 4,433,953 13,301,860 6,650,930 3,325,465 9,976,396 4,988,198 2,494,099 7,482,298 3,741,149 11,223,448 5,611,724 2,805,862 1,402,931 4,208,794 2,104,397

← Previous Integer #9,216,557 Browse Full Index Next Integer #9,216,559 →