9,332,352

2⁷ × 3² × 8101

9,332,352 factors as 2^7 × 3^2 × 8101. Its 48 positive divisors give a proper-divisor sum of 17,525,778, so this integer is abundant. The Collatz stopping time is 70 steps.

Prime Factor Structure

Factorization String 2^7 × 3^2 × 8101

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 26,858,130

Proper Divisor Sum 17,525,778

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #9332347 ← → #9332353

Radix Representation

Decimal	9332352
Binary	100011100110011010000000 (24 bits)
Octal	0o43463200
Hexadecimal	0x8E6680

Divisor Catalog (48)

1 2 3 4 6 8 9 12 16 18 24 32 36 48 64 72 96 128 144 192 288 384 576 1,152 8,101 16,202 24,303 32,404 48,606 64,808 72,909 97,212 129,616 145,818 194,424 259,232 291,636 388,848 518,464 583,272 777,696 1,036,928 1,166,544 1,555,392 2,333,088 3,110,784 4,666,176 9,332,352

Collatz Trajectory (70 steps to reach 1)

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

9,332,352 4,666,176 2,333,088 1,166,544 583,272 291,636 145,818 72,909 218,728 109,364 54,682 27,341 82,024 41,012 20,506 10,253 30,760 15,380 7,690 3,845 11,536 5,768 2,884 1,442 721 2,164 1,082 541 1,624 812 406 203 610 305 916 458 229 688 344 172 86 43 130 65 196 98 49 148 74 37 112 56 28 14 7 22 11 34 17 52

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