938,696

2³ × 11 × 10667

938,696 factors as 2^3 × 11 × 10667. Its 16 positive divisors give a proper-divisor sum of 981,544, so this integer is abundant. The Collatz stopping time is 201 steps.

Prime Factor Structure

Factorization String 2^3 × 11 × 10667

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,920,240

Proper Divisor Sum 981,544

Digit Sum / Digital Root 41 (Root: 5)

Adjacent Primes #938681 ← → #938713

Radix Representation

Decimal	938696
Binary	11100101001011001000 (20 bits)
Octal	0o3451310
Hexadecimal	0xE52C8

Divisor Catalog (16)

1 2 4 8 11 22 44 88 10,667 21,334 42,668 85,336 117,337 234,674 469,348 938,696

Collatz Trajectory (201 steps to reach 1)

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

938,696 469,348 234,674 117,337 352,012 176,006 88,003 264,010 132,005 396,016 198,008 99,004 49,502 24,751 74,254 37,127 111,382 55,691 167,074 83,537 250,612 125,306 62,653 187,960 93,980 46,990 23,495 70,486 35,243 105,730 52,865 158,596 79,298 39,649 118,948 59,474 29,737 89,212 44,606 22,303 66,910 33,455 100,366 50,183 150,550 75,275 225,826 112,913 338,740 169,370 84,685 254,056 127,028 63,514 31,757 95,272 47,636 23,818 11,909 35,728

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #938,695 Browse Full Index Next Integer #938,697 →