3,970,640

2⁴ × 5 × 49633

3,970,640 factors as 2^4 × 5 × 49633. Its 20 positive divisors give a proper-divisor sum of 5,261,284, so this integer is abundant. The Collatz stopping time is 123 steps.

Prime Factor Structure

Factorization String 2^4 × 5 × 49633

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 9,231,924

Proper Divisor Sum 5,261,284

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #3970633 ← → #3970643

Radix Representation

Decimal	3970640
Binary	1111001001011001010000 (22 bits)
Octal	0o17113120
Hexadecimal	0x3C9650

Divisor Catalog (20)

Collatz Trajectory (123 steps to reach 1)

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

3,970,640 1,985,320 992,660 496,330 248,165 744,496 372,248 186,124 93,062 46,531 139,594 69,797 209,392 104,696 52,348 26,174 13,087 39,262 19,631 58,894 29,447 88,342 44,171 132,514 66,257 198,772 99,386 49,693 149,080 74,540 37,270 18,635 55,906 27,953 83,860 41,930 20,965 62,896 31,448 15,724 7,862 3,931 11,794 5,897 17,692 8,846 4,423 13,270 6,635 19,906 9,953 29,860 14,930 7,465 22,396 11,198 5,599 16,798 8,399 25,198

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,970,639 Browse Full Index Next Integer #3,970,641 →