9,091,488

2⁵ × 3 × 7 × 83 × 163

9,091,488 factors as 2^5 × 3 × 7 × 83 × 163. Its 96 positive divisors give a proper-divisor sum of 18,680,928, so this integer is abundant. The Collatz stopping time is 181 steps.

Prime Factor Structure

Factorization String 2^5 × 3 × 7 × 83 × 163

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 27,772,416

Proper Divisor Sum 18,680,928

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #9091483 ← → #9091513

Radix Representation

Decimal	9091488
Binary	100010101011100110100000 (24 bits)
Octal	0o42534640
Hexadecimal	0x8AB9A0

Divisor Catalog (60 of 96)

1 2 3 4 6 7 8 12 14 16 21 24 28 32 42 48 56 83 84 96 112 163 166 168 224 249 326 332 336 489 498 581 652 664 672 978 996 1,141 1,162 1,304 1,328 1,743 1,956 1,992 2,282 2,324 2,608 2,656 3,423 3,486 3,912 3,984 4,564 4,648 5,216 6,846 6,972 7,824 7,968 9,128

Collatz Trajectory (181 steps to reach 1)

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

9,091,488 4,545,744 2,272,872 1,136,436 568,218 284,109 852,328 426,164 213,082 106,541 319,624 159,812 79,906 39,953 119,860 59,930 29,965 89,896 44,948 22,474 11,237 33,712 16,856 8,428 4,214 2,107 6,322 3,161 9,484 4,742 2,371 7,114 3,557 10,672 5,336 2,668 1,334 667 2,002 1,001 3,004 1,502 751 2,254 1,127 3,382 1,691 5,074 2,537 7,612 3,806 1,903 5,710 2,855 8,566 4,283 12,850 6,425 19,276 9,638

← Previous Integer #9,091,487 Browse Full Index Next Integer #9,091,489 →