3,976,872

2³ × 3 × 165703

3,976,872 factors as 2^3 × 3 × 165703. Its 16 positive divisors give a proper-divisor sum of 5,965,368, so this integer is abundant. The Collatz stopping time is 61 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 165703

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,942,240

Proper Divisor Sum 5,965,368

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #3976867 ← → #3976873

Radix Representation

Decimal	3976872
Binary	1111001010111010101000 (22 bits)
Octal	0o17127250
Hexadecimal	0x3CAEA8

Divisor Catalog (16)

1 2 3 4 6 8 12 24 165,703 331,406 497,109 662,812 994,218 1,325,624 1,988,436 3,976,872

Collatz Trajectory (61 steps to reach 1)

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

3,976,872 1,988,436 994,218 497,109 1,491,328 745,664 372,832 186,416 93,208 46,604 23,302 11,651 34,954 17,477 52,432 26,216 13,108 6,554 3,277 9,832 4,916 2,458 1,229 3,688 1,844 922 461 1,384 692 346 173 520 260 130 65 196 98 49 148 74 37 112 56 28 14 7 22 11 34 17 52 26 13 40 20 10 5 16 8 4

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,976,871 Browse Full Index Next Integer #3,976,873 →