3,980,708

2² × 467 × 2131

3,980,708 factors as 2^2 × 467 × 2131. Its 12 positive divisors give a proper-divisor sum of 3,003,724, so this integer is deficient. The Collatz stopping time is 66 steps.

Prime Factor Structure

Factorization String 2^2 × 467 × 2131

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 6,984,432

Proper Divisor Sum 3,003,724

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #3980693 ← → #3980729

Radix Representation

Decimal	3980708
Binary	1111001011110110100100 (22 bits)
Octal	0o17136644
Hexadecimal	0x3CBDA4

Divisor Catalog (12)

1 2 4 467 934 1,868 2,131 4,262 8,524 995,177 1,990,354 3,980,708

Collatz Trajectory (66 steps to reach 1)

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

3,980,708 1,990,354 995,177 2,985,532 1,492,766 746,383 2,239,150 1,119,575 3,358,726 1,679,363 5,038,090 2,519,045 7,557,136 3,778,568 1,889,284 944,642 472,321 1,416,964 708,482 354,241 1,062,724 531,362 265,681 797,044 398,522 199,261 597,784 298,892 149,446 74,723 224,170 112,085 336,256 168,128 84,064 42,032 21,016 10,508 5,254 2,627 7,882 3,941 11,824 5,912 2,956 1,478 739 2,218 1,109 3,328 1,664 832 416 208 104 52 26 13 40 20

← Previous Integer #3,980,707 Browse Full Index Next Integer #3,980,709 →