8,947,488

2⁵ × 3 × 11 × 37 × 229

8,947,488 factors as 2^5 × 3 × 11 × 37 × 229. Its 96 positive divisors give a proper-divisor sum of 17,482,272, so this integer is abundant. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 11 × 37 × 229

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 26,429,760

Proper Divisor Sum 17,482,272

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #8947487 ← → #8947501

Radix Representation

Decimal	8947488
Binary	100010001000011100100000 (24 bits)
Octal	0o42103440
Hexadecimal	0x888720

Divisor Catalog (60 of 96)

1 2 3 4 6 8 11 12 16 22 24 32 33 37 44 48 66 74 88 96 111 132 148 176 222 229 264 296 352 407 444 458 528 592 687 814 888 916 1,056 1,184 1,221 1,374 1,628 1,776 1,832 2,442 2,519 2,748 3,256 3,552 3,664 4,884 5,038 5,496 6,512 7,328 7,557 8,473 9,768 10,076

Collatz Trajectory (163 steps to reach 1)

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

8,947,488 4,473,744 2,236,872 1,118,436 559,218 279,609 838,828 419,414 209,707 629,122 314,561 943,684 471,842 235,921 707,764 353,882 176,941 530,824 265,412 132,706 66,353 199,060 99,530 49,765 149,296 74,648 37,324 18,662 9,331 27,994 13,997 41,992 20,996 10,498 5,249 15,748 7,874 3,937 11,812 5,906 2,953 8,860 4,430 2,215 6,646 3,323 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,947,487 Browse Full Index Next Integer #8,947,489 →