3,681,750

2 × 3 × 5³ × 4909

3,681,750 factors as 2 × 3 × 5^3 × 4909. Its 32 positive divisors give a proper-divisor sum of 5,509,770, so this integer is abundant. The Collatz stopping time is 190 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5^3 × 4909

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,191,520

Proper Divisor Sum 5,509,770

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3681749 ← → #3681761

Radix Representation

Decimal	3681750
Binary	1110000010110111010110 (22 bits)
Octal	0o16026726
Hexadecimal	0x382DD6

Divisor Catalog (32)

1 2 3 5 6 10 15 25 30 50 75 125 150 250 375 750 4,909 9,818 14,727 24,545 29,454 49,090 73,635 122,725 147,270 245,450 368,175 613,625 736,350 1,227,250 1,840,875 3,681,750

Collatz Trajectory (190 steps to reach 1)

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

3,681,750 1,840,875 5,522,626 2,761,313 8,283,940 4,141,970 2,070,985 6,212,956 3,106,478 1,553,239 4,659,718 2,329,859 6,989,578 3,494,789 10,484,368 5,242,184 2,621,092 1,310,546 655,273 1,965,820 982,910 491,455 1,474,366 737,183 2,211,550 1,105,775 3,317,326 1,658,663 4,975,990 2,487,995 7,463,986 3,731,993 11,195,980 5,597,990 2,798,995 8,396,986 4,198,493 12,595,480 6,297,740 3,148,870 1,574,435 4,723,306 2,361,653 7,084,960 3,542,480 1,771,240 885,620 442,810 221,405 664,216 332,108 166,054 83,027 249,082 124,541 373,624 186,812 93,406 46,703 140,110

← Previous Integer #3,681,749 Browse Full Index Next Integer #3,681,751 →