9,103,568

2⁴ × 17 × 33469

9,103,568 factors as 2^4 × 17 × 33469. Its 20 positive divisors give a proper-divisor sum of 9,572,692, so this integer is abundant. The Collatz stopping time is 194 steps.

Prime Factor Structure

Factorization String 2^4 × 17 × 33469

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 18,676,260

Proper Divisor Sum 9,572,692

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #9103541 ← → #9103609

Radix Representation

Decimal	9103568
Binary	100010101110100011010000 (24 bits)
Octal	0o42564320
Hexadecimal	0x8AE8D0

Divisor Catalog (20)

Collatz Trajectory (194 steps to reach 1)

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

9,103,568 4,551,784 2,275,892 1,137,946 568,973 1,706,920 853,460 426,730 213,365 640,096 320,048 160,024 80,012 40,006 20,003 60,010 30,005 90,016 45,008 22,504 11,252 5,626 2,813 8,440 4,220 2,110 1,055 3,166 1,583 4,750 2,375 7,126 3,563 10,690 5,345 16,036 8,018 4,009 12,028 6,014 3,007 9,022 4,511 13,534 6,767 20,302 10,151 30,454 15,227 45,682 22,841 68,524 34,262 17,131 51,394 25,697 77,092 38,546 19,273 57,820

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,103,567 Browse Full Index Next Integer #9,103,569 →