280,158

2 × 3 × 53 × 881

280,158 factors as 2 × 3 × 53 × 881. Its 16 positive divisors give a proper-divisor sum of 291,378, so this integer is abundant. The Collatz stopping time is 83 steps.

Prime Factor Structure

Factorization String 2 × 3 × 53 × 881

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 571,536

Proper Divisor Sum 291,378

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #280139 ← → #280183

Radix Representation

Decimal	280158
Binary	1000100011001011110 (19 bits)
Octal	0o1043136
Hexadecimal	0x4465E

Divisor Catalog (16)

1 2 3 6 53 106 159 318 881 1,762 2,643 5,286 46,693 93,386 140,079 280,158

Collatz Trajectory (83 steps to reach 1)

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

280,158 140,079 420,238 210,119 630,358 315,179 945,538 472,769 1,418,308 709,154 354,577 1,063,732 531,866 265,933 797,800 398,900 199,450 99,725 299,176 149,588 74,794 37,397 112,192 56,096 28,048 14,024 7,012 3,506 1,753 5,260 2,630 1,315 3,946 1,973 5,920 2,960 1,480 740 370 185 556 278 139 418 209 628 314 157 472 236 118 59 178 89 268 134 67 202 101 304

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #280,157 Browse Full Index Next Integer #280,159 →