3,860,346

2 × 3 × 7 × 107 × 859

3,860,346 factors as 2 × 3 × 7 × 107 × 859. Its 32 positive divisors give a proper-divisor sum of 5,056,134, so this integer is abundant. The Collatz stopping time is 216 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 107 × 859

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 8,916,480

Proper Divisor Sum 5,056,134

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #3860333 ← → #3860347

Radix Representation

Decimal	3860346
Binary	1110101110011101111010 (22 bits)
Octal	0o16563572
Hexadecimal	0x3AE77A

Divisor Catalog (32)

1 2 3 6 7 14 21 42 107 214 321 642 749 859 1,498 1,718 2,247 2,577 4,494 5,154 6,013 12,026 18,039 36,078 91,913 183,826 275,739 551,478 643,391 1,286,782 1,930,173 3,860,346

Collatz Trajectory (216 steps to reach 1)

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

3,860,346 1,930,173 5,790,520 2,895,260 1,447,630 723,815 2,171,446 1,085,723 3,257,170 1,628,585 4,885,756 2,442,878 1,221,439 3,664,318 1,832,159 5,496,478 2,748,239 8,244,718 4,122,359 12,367,078 6,183,539 18,550,618 9,275,309 27,825,928 13,912,964 6,956,482 3,478,241 10,434,724 5,217,362 2,608,681 7,826,044 3,913,022 1,956,511 5,869,534 2,934,767 8,804,302 4,402,151 13,206,454 6,603,227 19,809,682 9,904,841 29,714,524 14,857,262 7,428,631 22,285,894 11,142,947 33,428,842 16,714,421 50,143,264 25,071,632 12,535,816 6,267,908 3,133,954 1,566,977 4,700,932 2,350,466 1,175,233 3,525,700 1,762,850 881,425

← Previous Integer #3,860,345 Browse Full Index Next Integer #3,860,347 →