8,952,438

2 × 3 × 11 × 17 × 79 × 101

8,952,438 factors as 2 × 3 × 11 × 17 × 79 × 101. Its 64 positive divisors give a proper-divisor sum of 12,198,282, so this integer is abundant. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 17 × 79 × 101

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 21,150,720

Proper Divisor Sum 12,198,282

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #8952431 ← → #8952457

Radix Representation

Decimal	8952438
Binary	100010001001101001110110 (24 bits)
Octal	0o42115166
Hexadecimal	0x889A76

Divisor Catalog (60 of 64)

1 2 3 6 11 17 22 33 34 51 66 79 101 102 158 187 202 237 303 374 474 561 606 869 1,111 1,122 1,343 1,717 1,738 2,222 2,607 2,686 3,333 3,434 4,029 5,151 5,214 6,666 7,979 8,058 10,302 14,773 15,958 18,887 23,937 29,546 37,774 44,319 47,874 56,661 87,769 88,638 113,322 135,643 175,538 263,307 271,286 406,929 526,614 813,858

Collatz Trajectory (163 steps to reach 1)

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

8,952,438 4,476,219 13,428,658 6,714,329 20,142,988 10,071,494 5,035,747 15,107,242 7,553,621 22,660,864 11,330,432 5,665,216 2,832,608 1,416,304 708,152 354,076 177,038 88,519 265,558 132,779 398,338 199,169 597,508 298,754 149,377 448,132 224,066 112,033 336,100 168,050 84,025 252,076 126,038 63,019 189,058 94,529 283,588 141,794 70,897 212,692 106,346 53,173 159,520 79,760 39,880 19,940 9,970 4,985 14,956 7,478 3,739 11,218 5,609 16,828 8,414 4,207 12,622 6,311 18,934 9,467

← Previous Integer #8,952,437 Browse Full Index Next Integer #8,952,439 →