9,196,880

2⁴ × 5 × 7 × 11 × 1493

9,196,880 factors as 2^4 × 5 × 7 × 11 × 1493. Its 80 positive divisors give a proper-divisor sum of 17,479,984, so this integer is abundant. The Collatz stopping time is 57 steps.

Prime Factor Structure

Factorization String 2^4 × 5 × 7 × 11 × 1493

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 80

Divisor Sum (σ) 26,676,864

Proper Divisor Sum 17,479,984

Digit Sum / Digital Root 41 (Root: 5)

Adjacent Primes #9196877 ← → #9196897

Radix Representation

Decimal	9196880
Binary	100011000101010101010000 (24 bits)
Octal	0o43052520
Hexadecimal	0x8C5550

Divisor Catalog (60 of 80)

1 2 4 5 7 8 10 11 14 16 20 22 28 35 40 44 55 56 70 77 80 88 110 112 140 154 176 220 280 308 385 440 560 616 770 880 1,232 1,493 1,540 2,986 3,080 5,972 6,160 7,465 10,451 11,944 14,930 16,423 20,902 23,888 29,860 32,846 41,804 52,255 59,720 65,692 82,115 83,608 104,510 114,961

Collatz Trajectory (57 steps to reach 1)

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

9,196,880 4,598,440 2,299,220 1,149,610 574,805 1,724,416 862,208 431,104 215,552 107,776 53,888 26,944 13,472 6,736 3,368 1,684 842 421 1,264 632 316 158 79 238 119 358 179 538 269 808 404 202 101 304 152 76 38 19 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #9,196,879 Browse Full Index Next Integer #9,196,881 →