167,274

2 × 3² × 9293

167,274 factors as 2 × 3^2 × 9293. Its 12 positive divisors give a proper-divisor sum of 195,192, so this integer is abundant. The Collatz stopping time is 59 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 9293

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 362,466

Proper Divisor Sum 195,192

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #167269 ← → #167309

Radix Representation

Decimal	167274
Binary	101000110101101010 (18 bits)
Octal	0o506552
Hexadecimal	0x28D6A

Divisor Catalog (12)

1 2 3 6 9 18 9,293 18,586 27,879 55,758 83,637 167,274

Collatz Trajectory (59 steps to reach 1)

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

167,274 83,637 250,912 125,456 62,728 31,364 15,682 7,841 23,524 11,762 5,881 17,644 8,822 4,411 13,234 6,617 19,852 9,926 4,963 14,890 7,445 22,336 11,168 5,584 2,792 1,396 698 349 1,048 524 262 131 394 197 592 296 148 74 37 112 56 28 14 7 22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1

← Previous Integer #167,273 Browse Full Index Next Integer #167,275 →