3,950,644

2² × 191 × 5171

3,950,644 factors as 2^2 × 191 × 5171. Its 12 positive divisors give a proper-divisor sum of 3,000,524, so this integer is deficient. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 2^2 × 191 × 5171

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 6,951,168

Proper Divisor Sum 3,000,524

Digit Sum / Digital Root 31 (Root: 4)

Adjacent Primes #3950629 ← → #3950657

Radix Representation

Decimal	3950644
Binary	1111000100100000110100 (22 bits)
Octal	0o17044064
Hexadecimal	0x3C4834

Divisor Catalog (12)

1 2 4 191 382 764 5,171 10,342 20,684 987,661 1,975,322 3,950,644

Collatz Trajectory (92 steps to reach 1)

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

3,950,644 1,975,322 987,661 2,962,984 1,481,492 740,746 370,373 1,111,120 555,560 277,780 138,890 69,445 208,336 104,168 52,084 26,042 13,021 39,064 19,532 9,766 4,883 14,650 7,325 21,976 10,988 5,494 2,747 8,242 4,121 12,364 6,182 3,091 9,274 4,637 13,912 6,956 3,478 1,739 5,218 2,609 7,828 3,914 1,957 5,872 2,936 1,468 734 367 1,102 551 1,654 827 2,482 1,241 3,724 1,862 931 2,794 1,397 4,192

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,950,643 Browse Full Index Next Integer #3,950,645 →