9,231,338

2 × 29 × 159161

9,231,338 factors as 2 × 29 × 159161. Its 8 positive divisors give a proper-divisor sum of 5,093,242, so this integer is deficient. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2 × 29 × 159161

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 14,324,580

Proper Divisor Sum 5,093,242

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #9231331 ← → #9231371

Radix Representation

Decimal	9231338
Binary	100011001101101111101010 (24 bits)
Octal	0o43155752
Hexadecimal	0x8CDBEA

Divisor Catalog (8)

1 2 29 58 159,161 318,322 4,615,669 9,231,338

Collatz Trajectory (101 steps to reach 1)

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

9,231,338 4,615,669 13,847,008 6,923,504 3,461,752 1,730,876 865,438 432,719 1,298,158 649,079 1,947,238 973,619 2,920,858 1,460,429 4,381,288 2,190,644 1,095,322 547,661 1,642,984 821,492 410,746 205,373 616,120 308,060 154,030 77,015 231,046 115,523 346,570 173,285 519,856 259,928 129,964 64,982 32,491 97,474 48,737 146,212 73,106 36,553 109,660 54,830 27,415 82,246 41,123 123,370 61,685 185,056 92,528 46,264 23,132 11,566 5,783 17,350 8,675 26,026 13,013 39,040 19,520 9,760

← Previous Integer #9,231,337 Browse Full Index Next Integer #9,231,339 →