167,598

2 × 3² × 9311

167,598 factors as 2 × 3^2 × 9311. Its 12 positive divisors give a proper-divisor sum of 195,570, so this integer is abundant. The Collatz stopping time is 90 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 9311

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 363,168

Proper Divisor Sum 195,570

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #167597 ← → #167611

Radix Representation

Decimal	167598
Binary	101000111010101110 (18 bits)
Octal	0o507256
Hexadecimal	0x28EAE

Divisor Catalog (12)

1 2 3 6 9 18 9,311 18,622 27,933 55,866 83,799 167,598

Collatz Trajectory (90 steps to reach 1)

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

167,598 83,799 251,398 125,699 377,098 188,549 565,648 282,824 141,412 70,706 35,353 106,060 53,030 26,515 79,546 39,773 119,320 59,660 29,830 14,915 44,746 22,373 67,120 33,560 16,780 8,390 4,195 12,586 6,293 18,880 9,440 4,720 2,360 1,180 590 295 886 443 1,330 665 1,996 998 499 1,498 749 2,248 1,124 562 281 844 422 211 634 317 952 476 238 119 358 179

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #167,597 Browse Full Index Next Integer #167,599 →