940,698

2 × 3² × 11 × 4751

940,698 factors as 2 × 3^2 × 11 × 4751. Its 24 positive divisors give a proper-divisor sum of 1,283,238, so this integer is abundant. The Collatz stopping time is 201 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 11 × 4751

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 2,223,936

Proper Divisor Sum 1,283,238

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #940691 ← → #940703

Radix Representation

Decimal	940698
Binary	11100101101010011010 (20 bits)
Octal	0o3455232
Hexadecimal	0xE5A9A

Divisor Catalog (24)

Collatz Trajectory (201 steps to reach 1)

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

940,698 470,349 1,411,048 705,524 352,762 176,381 529,144 264,572 132,286 66,143 198,430 99,215 297,646 148,823 446,470 223,235 669,706 334,853 1,004,560 502,280 251,140 125,570 62,785 188,356 94,178 47,089 141,268 70,634 35,317 105,952 52,976 26,488 13,244 6,622 3,311 9,934 4,967 14,902 7,451 22,354 11,177 33,532 16,766 8,383 25,150 12,575 37,726 18,863 56,590 28,295 84,886 42,443 127,330 63,665 190,996 95,498 47,749 143,248 71,624 35,812

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #940,697 Browse Full Index Next Integer #940,699 →