33,234

2 × 3 × 29 × 191

33,234 factors as 2 × 3 × 29 × 191. Its 16 positive divisors give a proper-divisor sum of 35,886, so this integer is abundant. The Collatz stopping time is 191 steps.

Prime Factor Structure

Factorization String 2 × 3 × 29 × 191

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 69,120

Proper Divisor Sum 35,886

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #33223 ← → #33247

Radix Representation

Decimal	33234
Binary	1000000111010010 (16 bits)
Octal	0o100722
Hexadecimal	0x81D2

Divisor Catalog (16)

1 2 3 6 29 58 87 174 191 382 573 1,146 5,539 11,078 16,617 33,234

Collatz Trajectory (191 steps to reach 1)

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

33,234 16,617 49,852 24,926 12,463 37,390 18,695 56,086 28,043 84,130 42,065 126,196 63,098 31,549 94,648 47,324 23,662 11,831 35,494 17,747 53,242 26,621 79,864 39,932 19,966 9,983 29,950 14,975 44,926 22,463 67,390 33,695 101,086 50,543 151,630 75,815 227,446 113,723 341,170 170,585 511,756 255,878 127,939 383,818 191,909 575,728 287,864 143,932 71,966 35,983 107,950 53,975 161,926 80,963 242,890 121,445 364,336 182,168 91,084 45,542

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #33,233 Browse Full Index Next Integer #33,235 →