9,760,434

2 × 3 × 1626739

9,760,434 factors as 2 × 3 × 1626739. Its 8 positive divisors give a proper-divisor sum of 9,760,446, so this integer is abundant. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1626739

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 19,520,880

Proper Divisor Sum 9,760,446

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9760423 ← → #9760453

Radix Representation

Decimal	9760434
Binary	100101001110111010110010 (24 bits)
Octal	0o45167262
Hexadecimal	0x94EEB2

Divisor Catalog (8)

1 2 3 6 1,626,739 3,253,478 4,880,217 9,760,434

Collatz Trajectory (163 steps to reach 1)

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

9,760,434 4,880,217 14,640,652 7,320,326 3,660,163 10,980,490 5,490,245 16,470,736 8,235,368 4,117,684 2,058,842 1,029,421 3,088,264 1,544,132 772,066 386,033 1,158,100 579,050 289,525 868,576 434,288 217,144 108,572 54,286 27,143 81,430 40,715 122,146 61,073 183,220 91,610 45,805 137,416 68,708 34,354 17,177 51,532 25,766 12,883 38,650 19,325 57,976 28,988 14,494 7,247 21,742 10,871 32,614 16,307 48,922 24,461 73,384 36,692 18,346 9,173 27,520 13,760 6,880 3,440 1,720

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,760,433 Browse Full Index Next Integer #9,760,435 →