145,128

2³ × 3 × 6047

145,128 factors as 2^3 × 3 × 6047. Its 16 positive divisors give a proper-divisor sum of 217,752, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 6047

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 362,880

Proper Divisor Sum 217,752

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #145121 ← → #145133

Radix Representation

Decimal	145128
Binary	100011011011101000 (18 bits)
Octal	0o433350
Hexadecimal	0x236E8

Divisor Catalog (16)

1 2 3 4 6 8 12 24 6,047 12,094 18,141 24,188 36,282 48,376 72,564 145,128

Collatz Trajectory (95 steps to reach 1)

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

145,128 72,564 36,282 18,141 54,424 27,212 13,606 6,803 20,410 10,205 30,616 15,308 7,654 3,827 11,482 5,741 17,224 8,612 4,306 2,153 6,460 3,230 1,615 4,846 2,423 7,270 3,635 10,906 5,453 16,360 8,180 4,090 2,045 6,136 3,068 1,534 767 2,302 1,151 3,454 1,727 5,182 2,591 7,774 3,887 11,662 5,831 17,494 8,747 26,242 13,121 39,364 19,682 9,841 29,524 14,762 7,381 22,144 11,072 5,536

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #145,127 Browse Full Index Next Integer #145,129 →