8,911,122

2 × 3 × 11 × 135017

8,911,122 factors as 2 × 3 × 11 × 135017. Its 16 positive divisors give a proper-divisor sum of 10,531,470, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 135017

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 19,442,592

Proper Divisor Sum 10,531,470

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #8911103 ← → #8911141

Radix Representation

Decimal	8911122
Binary	100001111111100100010010 (24 bits)
Octal	0o41774422
Hexadecimal	0x87F912

Divisor Catalog (16)

1 2 3 6 11 22 33 66 135,017 270,034 405,051 810,102 1,485,187 2,970,374 4,455,561 8,911,122

Collatz Trajectory (88 steps to reach 1)

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

8,911,122 4,455,561 13,366,684 6,683,342 3,341,671 10,025,014 5,012,507 15,037,522 7,518,761 22,556,284 11,278,142 5,639,071 16,917,214 8,458,607 25,375,822 12,687,911 38,063,734 19,031,867 57,095,602 28,547,801 85,643,404 42,821,702 21,410,851 64,232,554 32,116,277 96,348,832 48,174,416 24,087,208 12,043,604 6,021,802 3,010,901 9,032,704 4,516,352 2,258,176 1,129,088 564,544 282,272 141,136 70,568 35,284 17,642 8,821 26,464 13,232 6,616 3,308 1,654 827 2,482 1,241 3,724 1,862 931 2,794 1,397 4,192 2,096 1,048 524 262

← Previous Integer #8,911,121 Browse Full Index Next Integer #8,911,123 →