103,254

2 × 3 × 17209

103,254 factors as 2 × 3 × 17209. Its 8 positive divisors give a proper-divisor sum of 103,266, so this integer is abundant. The Collatz stopping time is 185 steps.

Prime Factor Structure

Factorization String 2 × 3 × 17209

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 206,520

Proper Divisor Sum 103,266

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #103237 ← → #103289

Radix Representation

Decimal	103254
Binary	11001001101010110 (17 bits)
Octal	0o311526
Hexadecimal	0x19356

Divisor Catalog (8)

1 2 3 6 17,209 34,418 51,627 103,254

Collatz Trajectory (185 steps to reach 1)

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

103,254 51,627 154,882 77,441 232,324 116,162 58,081 174,244 87,122 43,561 130,684 65,342 32,671 98,014 49,007 147,022 73,511 220,534 110,267 330,802 165,401 496,204 248,102 124,051 372,154 186,077 558,232 279,116 139,558 69,779 209,338 104,669 314,008 157,004 78,502 39,251 117,754 58,877 176,632 88,316 44,158 22,079 66,238 33,119 99,358 49,679 149,038 74,519 223,558 111,779 335,338 167,669 503,008 251,504 125,752 62,876 31,438 15,719 47,158 23,579

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #103,253 Browse Full Index Next Integer #103,255 →