3,759,906

2 × 3 × 47 × 67 × 199

3,759,906 factors as 2 × 3 × 47 × 67 × 199. Its 32 positive divisors give a proper-divisor sum of 4,073,694, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2 × 3 × 47 × 67 × 199

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 7,833,600

Proper Divisor Sum 4,073,694

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3759901 ← → #3759919

Radix Representation

Decimal	3759906
Binary	1110010101111100100010 (22 bits)
Octal	0o16257442
Hexadecimal	0x395F22

Divisor Catalog (32)

1 2 3 6 47 67 94 134 141 199 201 282 398 402 597 1,194 3,149 6,298 9,353 9,447 13,333 18,706 18,894 26,666 28,059 39,999 56,118 79,998 626,651 1,253,302 1,879,953 3,759,906

Collatz Trajectory (84 steps to reach 1)

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

3,759,906 1,879,953 5,639,860 2,819,930 1,409,965 4,229,896 2,114,948 1,057,474 528,737 1,586,212 793,106 396,553 1,189,660 594,830 297,415 892,246 446,123 1,338,370 669,185 2,007,556 1,003,778 501,889 1,505,668 752,834 376,417 1,129,252 564,626 282,313 846,940 423,470 211,735 635,206 317,603 952,810 476,405 1,429,216 714,608 357,304 178,652 89,326 44,663 133,990 66,995 200,986 100,493 301,480 150,740 75,370 37,685 113,056 56,528 28,264 14,132 7,066 3,533 10,600 5,300 2,650 1,325 3,976

← Previous Integer #3,759,905 Browse Full Index Next Integer #3,759,907 →