635,286

2 × 3 × 113 × 937

635,286 factors as 2 × 3 × 113 × 937. Its 16 positive divisors give a proper-divisor sum of 647,898, so this integer is abundant. The Collatz stopping time is 154 steps.

Prime Factor Structure

Factorization String 2 × 3 × 113 × 937

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,283,184

Proper Divisor Sum 647,898

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #635279 ← → #635287

Radix Representation

Decimal	635286
Binary	10011011000110010110 (20 bits)
Octal	0o2330626
Hexadecimal	0x9B196

Divisor Catalog (16)

1 2 3 6 113 226 339 678 937 1,874 2,811 5,622 105,881 211,762 317,643 635,286

Collatz Trajectory (154 steps to reach 1)

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

635,286 317,643 952,930 476,465 1,429,396 714,698 357,349 1,072,048 536,024 268,012 134,006 67,003 201,010 100,505 301,516 150,758 75,379 226,138 113,069 339,208 169,604 84,802 42,401 127,204 63,602 31,801 95,404 47,702 23,851 71,554 35,777 107,332 53,666 26,833 80,500 40,250 20,125 60,376 30,188 15,094 7,547 22,642 11,321 33,964 16,982 8,491 25,474 12,737 38,212 19,106 9,553 28,660 14,330 7,165 21,496 10,748 5,374 2,687 8,062 4,031

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #635,285 Browse Full Index Next Integer #635,287 →