3,708,950

2 × 5² × 7 × 10597

3,708,950 factors as 2 × 5^2 × 7 × 10597. Its 24 positive divisors give a proper-divisor sum of 4,175,962, so this integer is abundant. The Collatz stopping time is 172 steps.

Prime Factor Structure

Factorization String 2 × 5^2 × 7 × 10597

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 7,884,912

Proper Divisor Sum 4,175,962

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #3708949 ← → #3708959

Radix Representation

Decimal	3708950
Binary	1110001001100000010110 (22 bits)
Octal	0o16114026
Hexadecimal	0x389816

Divisor Catalog (24)

1 2 5 7 10 14 25 35 50 70 175 350 10,597 21,194 52,985 74,179 105,970 148,358 264,925 370,895 529,850 741,790 1,854,475 3,708,950

Collatz Trajectory (172 steps to reach 1)

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

3,708,950 1,854,475 5,563,426 2,781,713 8,345,140 4,172,570 2,086,285 6,258,856 3,129,428 1,564,714 782,357 2,347,072 1,173,536 586,768 293,384 146,692 73,346 36,673 110,020 55,010 27,505 82,516 41,258 20,629 61,888 30,944 15,472 7,736 3,868 1,934 967 2,902 1,451 4,354 2,177 6,532 3,266 1,633 4,900 2,450 1,225 3,676 1,838 919 2,758 1,379 4,138 2,069 6,208 3,104 1,552 776 388 194 97 292 146 73 220 110

← Previous Integer #3,708,949 Browse Full Index Next Integer #3,708,951 →