3,936,760

2³ × 5 × 98419

3,936,760 factors as 2^3 × 5 × 98419. Its 16 positive divisors give a proper-divisor sum of 4,921,040, so this integer is abundant. The Collatz stopping time is 66 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 98419

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,857,800

Proper Divisor Sum 4,921,040

Digit Sum / Digital Root 34 (Root: 7)

Adjacent Primes #3936733 ← → #3936769

Radix Representation

Decimal	3936760
Binary	1111000001000111111000 (22 bits)
Octal	0o17010770
Hexadecimal	0x3C11F8

Divisor Catalog (16)

1 2 4 5 8 10 20 40 98,419 196,838 393,676 492,095 787,352 984,190 1,968,380 3,936,760

Collatz Trajectory (66 steps to reach 1)

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

3,936,760 1,968,380 984,190 492,095 1,476,286 738,143 2,214,430 1,107,215 3,321,646 1,660,823 4,982,470 2,491,235 7,473,706 3,736,853 11,210,560 5,605,280 2,802,640 1,401,320 700,660 350,330 175,165 525,496 262,748 131,374 65,687 197,062 98,531 295,594 147,797 443,392 221,696 110,848 55,424 27,712 13,856 6,928 3,464 1,732 866 433 1,300 650 325 976 488 244 122 61 184 92 46 23 70 35 106 53 160 80 40 20

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,936,759 Browse Full Index Next Integer #3,936,761 →