133,644

2² × 3 × 7 × 37 × 43

133,644 factors as 2^2 × 3 × 7 × 37 × 43. Its 48 positive divisors give a proper-divisor sum of 240,884, so this integer is abundant. The Collatz stopping time is 131 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 7 × 37 × 43

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 374,528

Proper Divisor Sum 240,884

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #133633 ← → #133649

Radix Representation

Decimal	133644
Binary	100000101000001100 (18 bits)
Octal	0o405014
Hexadecimal	0x20A0C

Divisor Catalog (48)

1 2 3 4 6 7 12 14 21 28 37 42 43 74 84 86 111 129 148 172 222 258 259 301 444 516 518 602 777 903 1,036 1,204 1,554 1,591 1,806 3,108 3,182 3,612 4,773 6,364 9,546 11,137 19,092 22,274 33,411 44,548 66,822 133,644

Collatz Trajectory (131 steps to reach 1)

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

133,644 66,822 33,411 100,234 50,117 150,352 75,176 37,588 18,794 9,397 28,192 14,096 7,048 3,524 1,762 881 2,644 1,322 661 1,984 992 496 248 124 62 31 94 47 142 71 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526 263 790 395 1,186 593 1,780 890

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #133,643 Browse Full Index Next Integer #133,645 →