3,950,684

2² × 389 × 2539

3,950,684 factors as 2^2 × 389 × 2539. Its 12 positive divisors give a proper-divisor sum of 2,983,516, so this integer is deficient. The Collatz stopping time is 154 steps.

Prime Factor Structure

Factorization String 2^2 × 389 × 2539

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 6,934,200

Proper Divisor Sum 2,983,516

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #3950659 ← → #3950693

Radix Representation

Decimal	3950684
Binary	1111000100100001011100 (22 bits)
Octal	0o17044134
Hexadecimal	0x3C485C

Divisor Catalog (12)

1 2 4 389 778 1,556 2,539 5,078 10,156 987,671 1,975,342 3,950,684

Collatz Trajectory (154 steps to reach 1)

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

3,950,684 1,975,342 987,671 2,963,014 1,481,507 4,444,522 2,222,261 6,666,784 3,333,392 1,666,696 833,348 416,674 208,337 625,012 312,506 156,253 468,760 234,380 117,190 58,595 175,786 87,893 263,680 131,840 65,920 32,960 16,480 8,240 4,120 2,060 1,030 515 1,546 773 2,320 1,160 580 290 145 436 218 109 328 164 82 41 124 62 31 94 47 142 71 214 107 322 161 484 242 121

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,950,683 Browse Full Index Next Integer #3,950,685 →