49,660

2² × 5 × 13 × 191

49,660 factors as 2^2 × 5 × 13 × 191. Its 24 positive divisors give a proper-divisor sum of 63,236, so this integer is abundant. The Collatz stopping time is 96 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 13 × 191

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 112,896

Proper Divisor Sum 63,236

Digit Sum / Digital Root 25 (Root: 7)

Adjacent Primes #49639 ← → #49663

Radix Representation

Decimal	49660
Binary	1100000111111100 (16 bits)
Octal	0o140774
Hexadecimal	0xC1FC

Divisor Catalog (24)

1 2 4 5 10 13 20 26 52 65 130 191 260 382 764 955 1,910 2,483 3,820 4,966 9,932 12,415 24,830 49,660

Collatz Trajectory (96 steps to reach 1)

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

49,660 24,830 12,415 37,246 18,623 55,870 27,935 83,806 41,903 125,710 62,855 188,566 94,283 282,850 141,425 424,276 212,138 106,069 318,208 159,104 79,552 39,776 19,888 9,944 4,972 2,486 1,243 3,730 1,865 5,596 2,798 1,399 4,198 2,099 6,298 3,149 9,448 4,724 2,362 1,181 3,544 1,772 886 443 1,330 665 1,996 998 499 1,498 749 2,248 1,124 562 281 844 422 211 634 317

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #49,659 Browse Full Index Next Integer #49,661 →