316,362

2 × 3 × 52727

316,362 factors as 2 × 3 × 52727. Its 8 positive divisors give a proper-divisor sum of 316,374, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2 × 3 × 52727

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 632,736

Proper Divisor Sum 316,374

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #316343 ← → #316363

Radix Representation

Decimal	316362
Binary	1001101001111001010 (19 bits)
Octal	0o1151712
Hexadecimal	0x4D3CA

Divisor Catalog (8)

1 2 3 6 52,727 105,454 158,181 316,362

Collatz Trajectory (101 steps to reach 1)

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

316,362 158,181 474,544 237,272 118,636 59,318 29,659 88,978 44,489 133,468 66,734 33,367 100,102 50,051 150,154 75,077 225,232 112,616 56,308 28,154 14,077 42,232 21,116 10,558 5,279 15,838 7,919 23,758 11,879 35,638 17,819 53,458 26,729 80,188 40,094 20,047 60,142 30,071 90,214 45,107 135,322 67,661 202,984 101,492 50,746 25,373 76,120 38,060 19,030 9,515 28,546 14,273 42,820 21,410 10,705 32,116 16,058 8,029 24,088 12,044

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #316,361 Browse Full Index Next Integer #316,363 →