8,974,734

2 × 3 × 331 × 4519

8,974,734 factors as 2 × 3 × 331 × 4519. Its 16 positive divisors give a proper-divisor sum of 9,032,946, so this integer is abundant. The Collatz stopping time is 225 steps.

Prime Factor Structure

Factorization String 2 × 3 × 331 × 4519

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 18,007,680

Proper Divisor Sum 9,032,946

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #8974723 ← → #8974741

Radix Representation

Decimal	8974734
Binary	100010001111000110001110 (24 bits)
Octal	0o42170616
Hexadecimal	0x88F18E

Divisor Catalog (16)

1 2 3 6 331 662 993 1,986 4,519 9,038 13,557 27,114 1,495,789 2,991,578 4,487,367 8,974,734

Collatz Trajectory (225 steps to reach 1)

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

8,974,734 4,487,367 13,462,102 6,731,051 20,193,154 10,096,577 30,289,732 15,144,866 7,572,433 22,717,300 11,358,650 5,679,325 17,037,976 8,518,988 4,259,494 2,129,747 6,389,242 3,194,621 9,583,864 4,791,932 2,395,966 1,197,983 3,593,950 1,796,975 5,390,926 2,695,463 8,086,390 4,043,195 12,129,586 6,064,793 18,194,380 9,097,190 4,548,595 13,645,786 6,822,893 20,468,680 10,234,340 5,117,170 2,558,585 7,675,756 3,837,878 1,918,939 5,756,818 2,878,409 8,635,228 4,317,614 2,158,807 6,476,422 3,238,211 9,714,634 4,857,317 14,571,952 7,285,976 3,642,988 1,821,494 910,747 2,732,242 1,366,121 4,098,364 2,049,182

← Previous Integer #8,974,733 Browse Full Index Next Integer #8,974,735 →