9,704,840

2³ × 5 × 242621

9,704,840 factors as 2^3 × 5 × 242621. Its 16 positive divisors give a proper-divisor sum of 12,131,140, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 242621

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 21,835,980

Proper Divisor Sum 12,131,140

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #9704833 ← → #9704861

Radix Representation

Decimal	9704840
Binary	100101000001010110001000 (24 bits)
Octal	0o45012610
Hexadecimal	0x941588

Divisor Catalog (16)

1 2 4 5 8 10 20 40 242,621 485,242 970,484 1,213,105 1,940,968 2,426,210 4,852,420 9,704,840

Collatz Trajectory (101 steps to reach 1)

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

9,704,840 4,852,420 2,426,210 1,213,105 3,639,316 1,819,658 909,829 2,729,488 1,364,744 682,372 341,186 170,593 511,780 255,890 127,945 383,836 191,918 95,959 287,878 143,939 431,818 215,909 647,728 323,864 161,932 80,966 40,483 121,450 60,725 182,176 91,088 45,544 22,772 11,386 5,693 17,080 8,540 4,270 2,135 6,406 3,203 9,610 4,805 14,416 7,208 3,604 1,802 901 2,704 1,352 676 338 169 508 254 127 382 191 574 287

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,704,839 Browse Full Index Next Integer #9,704,841 →