9,102,260

2² × 5 × 199 × 2287

9,102,260 factors as 2^2 × 5 × 199 × 2287. Its 24 positive divisors give a proper-divisor sum of 10,116,940, so this integer is abundant. The Collatz stopping time is 80 steps.

Prime Factor Structure

Factorization String 2^2 × 5 × 199 × 2287

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 19,219,200

Proper Divisor Sum 10,116,940

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #9102241 ← → #9102277

Radix Representation

Decimal	9102260
Binary	100010101110001110110100 (24 bits)
Octal	0o42561664
Hexadecimal	0x8AE3B4

Divisor Catalog (24)

Collatz Trajectory (80 steps to reach 1)

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

9,102,260 4,551,130 2,275,565 6,826,696 3,413,348 1,706,674 853,337 2,560,012 1,280,006 640,003 1,920,010 960,005 2,880,016 1,440,008 720,004 360,002 180,001 540,004 270,002 135,001 405,004 202,502 101,251 303,754 151,877 455,632 227,816 113,908 56,954 28,477 85,432 42,716 21,358 10,679 32,038 16,019 48,058 24,029 72,088 36,044 18,022 9,011 27,034 13,517 40,552 20,276 10,138 5,069 15,208 7,604 3,802 1,901 5,704 2,852 1,426 713 2,140 1,070 535 1,606

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,102,259 Browse Full Index Next Integer #9,102,261 →