3,982,280

2³ × 5 × 29 × 3433

3,982,280 factors as 2^3 × 5 × 29 × 3433. Its 32 positive divisors give a proper-divisor sum of 5,289,520, so this integer is abundant. The Collatz stopping time is 291 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 29 × 3433

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 9,271,800

Proper Divisor Sum 5,289,520

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #3982271 ← → #3982283

Radix Representation

Decimal	3982280
Binary	1111001100001111001000 (22 bits)
Octal	0o17141710
Hexadecimal	0x3CC3C8

Divisor Catalog (32)

1 2 4 5 8 10 20 29 40 58 116 145 232 290 580 1,160 3,433 6,866 13,732 17,165 27,464 34,330 68,660 99,557 137,320 199,114 398,228 497,785 796,456 995,570 1,991,140 3,982,280

Collatz Trajectory (291 steps to reach 1)

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

3,982,280 1,991,140 995,570 497,785 1,493,356 746,678 373,339 1,120,018 560,009 1,680,028 840,014 420,007 1,260,022 630,011 1,890,034 945,017 2,835,052 1,417,526 708,763 2,126,290 1,063,145 3,189,436 1,594,718 797,359 2,392,078 1,196,039 3,588,118 1,794,059 5,382,178 2,691,089 8,073,268 4,036,634 2,018,317 6,054,952 3,027,476 1,513,738 756,869 2,270,608 1,135,304 567,652 283,826 141,913 425,740 212,870 106,435 319,306 159,653 478,960 239,480 119,740 59,870 29,935 89,806 44,903 134,710 67,355 202,066 101,033 303,100 151,550

← Previous Integer #3,982,279 Browse Full Index Next Integer #3,982,281 →