1,000,752

2⁴ × 3 × 20849

1,000,752 factors as 2^4 × 3 × 20849. Its 20 positive divisors give a proper-divisor sum of 1,584,648, so this integer is abundant. The Collatz stopping time is 139 steps.

Prime Factor Structure

Factorization String 2^4 × 3 × 20849

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 2,585,400

Proper Divisor Sum 1,584,648

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #1000723 ← → #1000763

Radix Representation

Decimal	1000752
Binary	11110100010100110000 (20 bits)
Octal	0o3642460
Hexadecimal	0xF4530

Divisor Catalog (20)

Collatz Trajectory (139 steps to reach 1)

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

1,000,752 500,376 250,188 125,094 62,547 187,642 93,821 281,464 140,732 70,366 35,183 105,550 52,775 158,326 79,163 237,490 118,745 356,236 178,118 89,059 267,178 133,589 400,768 200,384 100,192 50,096 25,048 12,524 6,262 3,131 9,394 4,697 14,092 7,046 3,523 10,570 5,285 15,856 7,928 3,964 1,982 991 2,974 1,487 4,462 2,231 6,694 3,347 10,042 5,021 15,064 7,532 3,766 1,883 5,650 2,825 8,476 4,238 2,119 6,358

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,000,751 Browse Full Index Next Integer #1,000,753 →