8,833,776

2⁴ × 3 × 7 × 61 × 431

8,833,776 factors as 2^4 × 3 × 7 × 61 × 431. Its 80 positive divisors give a proper-divisor sum of 17,735,952, so this integer is abundant. The Collatz stopping time is 212 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 7 × 61 × 431

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 80

Divisor Sum (σ) 26,569,728

Proper Divisor Sum 17,735,952

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #8833757 ← → #8833789

Radix Representation

Decimal	8833776
Binary	100001101100101011110000 (24 bits)
Octal	0o41545360
Hexadecimal	0x86CAF0

Divisor Catalog (60 of 80)

1 2 3 4 6 7 8 12 14 16 21 24 28 42 48 56 61 84 112 122 168 183 244 336 366 427 431 488 732 854 862 976 1,281 1,293 1,464 1,708 1,724 2,562 2,586 2,928 3,017 3,416 3,448 5,124 5,172 6,034 6,832 6,896 9,051 10,248 10,344 12,068 18,102 20,496 20,688 24,136 26,291 36,204 48,272 52,582

Collatz Trajectory (212 steps to reach 1)

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

8,833,776 4,416,888 2,208,444 1,104,222 552,111 1,656,334 828,167 2,484,502 1,242,251 3,726,754 1,863,377 5,590,132 2,795,066 1,397,533 4,192,600 2,096,300 1,048,150 524,075 1,572,226 786,113 2,358,340 1,179,170 589,585 1,768,756 884,378 442,189 1,326,568 663,284 331,642 165,821 497,464 248,732 124,366 62,183 186,550 93,275 279,826 139,913 419,740 209,870 104,935 314,806 157,403 472,210 236,105 708,316 354,158 177,079 531,238 265,619 796,858 398,429 1,195,288 597,644 298,822 149,411 448,234 224,117 672,352 336,176

← Previous Integer #8,833,775 Browse Full Index Next Integer #8,833,777 →