1,964,396

2² × 7 × 70157

1,964,396 factors as 2^2 × 7 × 70157. Its 12 positive divisors give a proper-divisor sum of 1,964,452, so this integer is abundant. The Collatz stopping time is 78 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 70157

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 3,928,848

Proper Divisor Sum 1,964,452

Digit Sum / Digital Root 38 (Root: 2)

Adjacent Primes #1964387 ← → #1964399

Radix Representation

Decimal	1964396
Binary	111011111100101101100 (21 bits)
Octal	0o7374554
Hexadecimal	0x1DF96C

Divisor Catalog (12)

1 2 4 7 14 28 70,157 140,314 280,628 491,099 982,198 1,964,396

Collatz Trajectory (78 steps to reach 1)

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

1,964,396 982,198 491,099 1,473,298 736,649 2,209,948 1,104,974 552,487 1,657,462 828,731 2,486,194 1,243,097 3,729,292 1,864,646 932,323 2,796,970 1,398,485 4,195,456 2,097,728 1,048,864 524,432 262,216 131,108 65,554 32,777 98,332 49,166 24,583 73,750 36,875 110,626 55,313 165,940 82,970 41,485 124,456 62,228 31,114 15,557 46,672 23,336 11,668 5,834 2,917 8,752 4,376 2,188 1,094 547 1,642 821 2,464 1,232 616 308 154 77 232 116 58

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,964,395 Browse Full Index Next Integer #1,964,397 →