9,238,768

2⁴ × 7 × 11 × 7499

9,238,768 factors as 2^4 × 7 × 11 × 7499. Its 40 positive divisors give a proper-divisor sum of 13,081,232, so this integer is abundant. The Collatz stopping time is 150 steps.

Prime Factor Structure

Factorization String 2^4 × 7 × 11 × 7499

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 22,320,000

Proper Divisor Sum 13,081,232

Digit Sum / Digital Root 43 (Root: 7)

Adjacent Primes #9238763 ← → #9238771

Radix Representation

Decimal	9238768
Binary	100011001111100011110000 (24 bits)
Octal	0o43174360
Hexadecimal	0x8CF8F0

Divisor Catalog (40)

1 2 4 7 8 11 14 16 22 28 44 56 77 88 112 154 176 308 616 1,232 7,499 14,998 29,996 52,493 59,992 82,489 104,986 119,984 164,978 209,972 329,956 419,944 577,423 659,912 839,888 1,154,846 1,319,824 2,309,692 4,619,384 9,238,768

Collatz Trajectory (150 steps to reach 1)

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

9,238,768 4,619,384 2,309,692 1,154,846 577,423 1,732,270 866,135 2,598,406 1,299,203 3,897,610 1,948,805 5,846,416 2,923,208 1,461,604 730,802 365,401 1,096,204 548,102 274,051 822,154 411,077 1,233,232 616,616 308,308 154,154 77,077 231,232 115,616 57,808 28,904 14,452 7,226 3,613 10,840 5,420 2,710 1,355 4,066 2,033 6,100 3,050 1,525 4,576 2,288 1,144 572 286 143 430 215 646 323 970 485 1,456 728 364 182 91 274

← Previous Integer #9,238,767 Browse Full Index Next Integer #9,238,769 →