9,247,968

2⁵ × 3² × 163 × 197

9,247,968 factors as 2^5 × 3^2 × 163 × 197. Its 72 positive divisors give a proper-divisor sum of 17,346,600, so this integer is abundant. The Collatz stopping time is 194 steps.

Prime Factor Structure

Factorization String 2^5 × 3^2 × 163 × 197

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 72

Divisor Sum (σ) 26,594,568

Proper Divisor Sum 17,346,600

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #9247939 ← → #9247969

Radix Representation

Decimal	9247968
Binary	100011010001110011100000 (24 bits)
Octal	0o43216340
Hexadecimal	0x8D1CE0

Divisor Catalog (60 of 72)

1 2 3 4 6 8 9 12 16 18 24 32 36 48 72 96 144 163 197 288 326 394 489 591 652 788 978 1,182 1,304 1,467 1,576 1,773 1,956 2,364 2,608 2,934 3,152 3,546 3,912 4,728 5,216 5,868 6,304 7,092 7,824 9,456 11,736 14,184 15,648 18,912 23,472 28,368 32,111 46,944 56,736 64,222 96,333 128,444 192,666 256,888

Collatz Trajectory (194 steps to reach 1)

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

9,247,968 4,623,984 2,311,992 1,155,996 577,998 288,999 866,998 433,499 1,300,498 650,249 1,950,748 975,374 487,687 1,463,062 731,531 2,194,594 1,097,297 3,291,892 1,645,946 822,973 2,468,920 1,234,460 617,230 308,615 925,846 462,923 1,388,770 694,385 2,083,156 1,041,578 520,789 1,562,368 781,184 390,592 195,296 97,648 48,824 24,412 12,206 6,103 18,310 9,155 27,466 13,733 41,200 20,600 10,300 5,150 2,575 7,726 3,863 11,590 5,795 17,386 8,693 26,080 13,040 6,520 3,260 1,630

← Previous Integer #9,247,967 Browse Full Index Next Integer #9,247,969 →