209,112

2³ × 3 × 8713

209,112 factors as 2^3 × 3 × 8713. Its 16 positive divisors give a proper-divisor sum of 313,728, so this integer is abundant. The Collatz stopping time is 111 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 8713

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 522,840

Proper Divisor Sum 313,728

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #209089 ← → #209123

Radix Representation

Decimal	209112
Binary	110011000011011000 (18 bits)
Octal	0o630330
Hexadecimal	0x330D8

Divisor Catalog (16)

1 2 3 4 6 8 12 24 8,713 17,426 26,139 34,852 52,278 69,704 104,556 209,112

Collatz Trajectory (111 steps to reach 1)

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

209,112 104,556 52,278 26,139 78,418 39,209 117,628 58,814 29,407 88,222 44,111 132,334 66,167 198,502 99,251 297,754 148,877 446,632 223,316 111,658 55,829 167,488 83,744 41,872 20,936 10,468 5,234 2,617 7,852 3,926 1,963 5,890 2,945 8,836 4,418 2,209 6,628 3,314 1,657 4,972 2,486 1,243 3,730 1,865 5,596 2,798 1,399 4,198 2,099 6,298 3,149 9,448 4,724 2,362 1,181 3,544 1,772 886 443 1,330

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #209,111 Browse Full Index Next Integer #209,113 →