3,914,786

2 × 937 × 2089

3,914,786 factors as 2 × 937 × 2089. Its 8 positive divisors give a proper-divisor sum of 1,966,474, so this integer is deficient. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 2 × 937 × 2089

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 5,881,260

Proper Divisor Sum 1,966,474

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #3914783 ← → #3914819

Radix Representation

Decimal	3914786
Binary	1110111011110000100010 (22 bits)
Octal	0o16736042
Hexadecimal	0x3BBC22

Divisor Catalog (8)

1 2 937 1,874 2,089 4,178 1,957,393 3,914,786

Collatz Trajectory (92 steps to reach 1)

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

3,914,786 1,957,393 5,872,180 2,936,090 1,468,045 4,404,136 2,202,068 1,101,034 550,517 1,651,552 825,776 412,888 206,444 103,222 51,611 154,834 77,417 232,252 116,126 58,063 174,190 87,095 261,286 130,643 391,930 195,965 587,896 293,948 146,974 73,487 220,462 110,231 330,694 165,347 496,042 248,021 744,064 372,032 186,016 93,008 46,504 23,252 11,626 5,813 17,440 8,720 4,360 2,180 1,090 545 1,636 818 409 1,228 614 307 922 461 1,384 692

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,914,785 Browse Full Index Next Integer #3,914,787 →