3,970,952

2³ × 139 × 3571

3,970,952 factors as 2^3 × 139 × 3571. Its 16 positive divisors give a proper-divisor sum of 3,530,248, so this integer is deficient. The Collatz stopping time is 61 steps.

Prime Factor Structure

Factorization String 2^3 × 139 × 3571

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,501,200

Proper Divisor Sum 3,530,248

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #3970949 ← → #3970991

Radix Representation

Decimal	3970952
Binary	1111001001011110001000 (22 bits)
Octal	0o17113610
Hexadecimal	0x3C9788

Divisor Catalog (16)

1 2 4 8 139 278 556 1,112 3,571 7,142 14,284 28,568 496,369 992,738 1,985,476 3,970,952

Collatz Trajectory (61 steps to reach 1)

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

3,970,952 1,985,476 992,738 496,369 1,489,108 744,554 372,277 1,116,832 558,416 279,208 139,604 69,802 34,901 104,704 52,352 26,176 13,088 6,544 3,272 1,636 818 409 1,228 614 307 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,970,951 Browse Full Index Next Integer #3,970,953 →