145,254

2 × 3 × 43 × 563

145,254 factors as 2 × 3 × 43 × 563. Its 16 positive divisors give a proper-divisor sum of 152,538, so this integer is abundant. The Collatz stopping time is 188 steps.

Prime Factor Structure

Factorization String 2 × 3 × 43 × 563

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 297,792

Proper Divisor Sum 152,538

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #145253 ← → #145259

Radix Representation

Decimal	145254
Binary	100011011101100110 (18 bits)
Octal	0o433546
Hexadecimal	0x23766

Divisor Catalog (16)

1 2 3 6 43 86 129 258 563 1,126 1,689 3,378 24,209 48,418 72,627 145,254

Collatz Trajectory (188 steps to reach 1)

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

145,254 72,627 217,882 108,941 326,824 163,412 81,706 40,853 122,560 61,280 30,640 15,320 7,660 3,830 1,915 5,746 2,873 8,620 4,310 2,155 6,466 3,233 9,700 4,850 2,425 7,276 3,638 1,819 5,458 2,729 8,188 4,094 2,047 6,142 3,071 9,214 4,607 13,822 6,911 20,734 10,367 31,102 15,551 46,654 23,327 69,982 34,991 104,974 52,487 157,462 78,731 236,194 118,097 354,292 177,146 88,573 265,720 132,860 66,430 33,215

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #145,253 Browse Full Index Next Integer #145,255 →