9,191,208

2³ × 3 × 13 × 89 × 331

9,191,208 factors as 2^3 × 3 × 13 × 89 × 331. Its 64 positive divisors give a proper-divisor sum of 15,907,992, so this integer is abundant. The Collatz stopping time is 181 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 13 × 89 × 331

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 25,099,200

Proper Divisor Sum 15,907,992

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #9191201 ← → #9191227

Radix Representation

Decimal	9191208
Binary	100011000011111100101000 (24 bits)
Octal	0o43037450
Hexadecimal	0x8C3F28

Divisor Catalog (60 of 64)

1 2 3 4 6 8 12 13 24 26 39 52 78 89 104 156 178 267 312 331 356 534 662 712 993 1,068 1,157 1,324 1,986 2,136 2,314 2,648 3,471 3,972 4,303 4,628 6,942 7,944 8,606 9,256 12,909 13,884 17,212 25,818 27,768 29,459 34,424 51,636 58,918 88,377 103,272 117,836 176,754 235,672 353,508 382,967 707,016 765,934 1,148,901 1,531,868

Collatz Trajectory (181 steps to reach 1)

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

9,191,208 4,595,604 2,297,802 1,148,901 3,446,704 1,723,352 861,676 430,838 215,419 646,258 323,129 969,388 484,694 242,347 727,042 363,521 1,090,564 545,282 272,641 817,924 408,962 204,481 613,444 306,722 153,361 460,084 230,042 115,021 345,064 172,532 86,266 43,133 129,400 64,700 32,350 16,175 48,526 24,263 72,790 36,395 109,186 54,593 163,780 81,890 40,945 122,836 61,418 30,709 92,128 46,064 23,032 11,516 5,758 2,879 8,638 4,319 12,958 6,479 19,438 9,719

← Previous Integer #9,191,207 Browse Full Index Next Integer #9,191,209 →