9,356,352

2⁶ × 3 × 48731

9,356,352 factors as 2^6 × 3 × 48731. Its 28 positive divisors give a proper-divisor sum of 15,399,504, so this integer is abundant. The Collatz stopping time is 163 steps.

Prime Factor Structure

Factorization String 2^6 × 3 × 48731

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 28

Divisor Sum (σ) 24,755,856

Proper Divisor Sum 15,399,504

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #9356351 ← → #9356371

Radix Representation

Decimal	9356352
Binary	100011101100010001000000 (24 bits)
Octal	0o43542100
Hexadecimal	0x8EC440

Divisor Catalog (28)

1 2 3 4 6 8 12 16 24 32 48 64 96 192 48,731 97,462 146,193 194,924 292,386 389,848 584,772 779,696 1,169,544 1,559,392 2,339,088 3,118,784 4,678,176 9,356,352

Collatz Trajectory (163 steps to reach 1)

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

9,356,352 4,678,176 2,339,088 1,169,544 584,772 292,386 146,193 438,580 219,290 109,645 328,936 164,468 82,234 41,117 123,352 61,676 30,838 15,419 46,258 23,129 69,388 34,694 17,347 52,042 26,021 78,064 39,032 19,516 9,758 4,879 14,638 7,319 21,958 10,979 32,938 16,469 49,408 24,704 12,352 6,176 3,088 1,544 772 386 193 580 290 145 436 218 109 328 164 82 41 124 62 31 94 47

← Previous Integer #9,356,351 Browse Full Index Next Integer #9,356,353 →