1,009,752

2³ × 3 × 42073

1,009,752 factors as 2^3 × 3 × 42073. Its 16 positive divisors give a proper-divisor sum of 1,514,688, so this integer is abundant. The Collatz stopping time is 152 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 42073

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,524,440

Proper Divisor Sum 1,514,688

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1009747 ← → #1009781

Radix Representation

Decimal	1009752
Binary	11110110100001011000 (20 bits)
Octal	0o3664130
Hexadecimal	0xF6858

Divisor Catalog (16)

1 2 3 4 6 8 12 24 42,073 84,146 126,219 168,292 252,438 336,584 504,876 1,009,752

Collatz Trajectory (152 steps to reach 1)

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

1,009,752 504,876 252,438 126,219 378,658 189,329 567,988 283,994 141,997 425,992 212,996 106,498 53,249 159,748 79,874 39,937 119,812 59,906 29,953 89,860 44,930 22,465 67,396 33,698 16,849 50,548 25,274 12,637 37,912 18,956 9,478 4,739 14,218 7,109 21,328 10,664 5,332 2,666 1,333 4,000 2,000 1,000 500 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364 182

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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