3,962,001

3 × 1320667

3,962,001 factors as 3 × 1320667. Its 4 positive divisors give a proper-divisor sum of 1,320,671, so this integer is deficient. The Collatz stopping time is 185 steps.

Prime Factor Structure

Factorization String 3 × 1320667

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 5,282,672

Proper Divisor Sum 1,320,671

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #3961987 ← → #3962029

Radix Representation

Decimal	3962001
Binary	1111000111010010010001 (22 bits)
Octal	0o17072221
Hexadecimal	0x3C7491

Divisor Catalog (4)

1 3 1,320,667 3,962,001

Collatz Trajectory (185 steps to reach 1)

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

3,962,001 11,886,004 5,943,002 2,971,501 8,914,504 4,457,252 2,228,626 1,114,313 3,342,940 1,671,470 835,735 2,507,206 1,253,603 3,760,810 1,880,405 5,641,216 2,820,608 1,410,304 705,152 352,576 176,288 88,144 44,072 22,036 11,018 5,509 16,528 8,264 4,132 2,066 1,033 3,100 1,550 775 2,326 1,163 3,490 1,745 5,236 2,618 1,309 3,928 1,964 982 491 1,474 737 2,212 1,106 553 1,660 830 415 1,246 623 1,870 935 2,806 1,403 4,210

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,962,000 Browse Full Index Next Integer #3,962,002 →