8,977,674

2 × 3 × 1496279

8,977,674 factors as 2 × 3 × 1496279. Its 8 positive divisors give a proper-divisor sum of 8,977,686, so this integer is abundant. The Collatz stopping time is 137 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1496279

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 17,955,360

Proper Divisor Sum 8,977,686

Digit Sum / Digital Root 48 (Root: 3)

Adjacent Primes #8977673 ← → #8977679

Radix Representation

Decimal	8977674
Binary	100010001111110100001010 (24 bits)
Octal	0o42176412
Hexadecimal	0x88FD0A

Divisor Catalog (8)

1 2 3 6 1,496,279 2,992,558 4,488,837 8,977,674

Collatz Trajectory (137 steps to reach 1)

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

8,977,674 4,488,837 13,466,512 6,733,256 3,366,628 1,683,314 841,657 2,524,972 1,262,486 631,243 1,893,730 946,865 2,840,596 1,420,298 710,149 2,130,448 1,065,224 532,612 266,306 133,153 399,460 199,730 99,865 299,596 149,798 74,899 224,698 112,349 337,048 168,524 84,262 42,131 126,394 63,197 189,592 94,796 47,398 23,699 71,098 35,549 106,648 53,324 26,662 13,331 39,994 19,997 59,992 29,996 14,998 7,499 22,498 11,249 33,748 16,874 8,437 25,312 12,656 6,328 3,164 1,582

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #8,977,673 Browse Full Index Next Integer #8,977,675 →