3,727,866

2 × 3 × 277 × 2243

3,727,866 factors as 2 × 3 × 277 × 2243. Its 16 positive divisors give a proper-divisor sum of 3,758,118, so this integer is abundant. The Collatz stopping time is 172 steps.

Prime Factor Structure

Factorization String 2 × 3 × 277 × 2243

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,485,984

Proper Divisor Sum 3,758,118

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #3727859 ← → #3727873

Radix Representation

Decimal	3727866
Binary	1110001110000111111010 (22 bits)
Octal	0o16160772
Hexadecimal	0x38E1FA

Divisor Catalog (16)

1 2 3 6 277 554 831 1,662 2,243 4,486 6,729 13,458 621,311 1,242,622 1,863,933 3,727,866

Collatz Trajectory (172 steps to reach 1)

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

3,727,866 1,863,933 5,591,800 2,795,900 1,397,950 698,975 2,096,926 1,048,463 3,145,390 1,572,695 4,718,086 2,359,043 7,077,130 3,538,565 10,615,696 5,307,848 2,653,924 1,326,962 663,481 1,990,444 995,222 497,611 1,492,834 746,417 2,239,252 1,119,626 559,813 1,679,440 839,720 419,860 209,930 104,965 314,896 157,448 78,724 39,362 19,681 59,044 29,522 14,761 44,284 22,142 11,071 33,214 16,607 49,822 24,911 74,734 37,367 112,102 56,051 168,154 84,077 252,232 126,116 63,058 31,529 94,588 47,294 23,647

← Previous Integer #3,727,865 Browse Full Index Next Integer #3,727,867 →