82,230

2 × 3 × 5 × 2741

82,230 factors as 2 × 3 × 5 × 2741. Its 16 positive divisors give a proper-divisor sum of 115,194, so this integer is abundant. The Collatz stopping time is 138 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 2741

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 197,424

Proper Divisor Sum 115,194

Digit Sum / Digital Root 15 (Root: 6)

Adjacent Primes #82223 ← → #82231

Radix Representation

Decimal	82230
Binary	10100000100110110 (17 bits)
Octal	0o240466
Hexadecimal	0x14136

Divisor Catalog (16)

1 2 3 5 6 10 15 30 2,741 5,482 8,223 13,705 16,446 27,410 41,115 82,230

Collatz Trajectory (138 steps to reach 1)

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

82,230 41,115 123,346 61,673 185,020 92,510 46,255 138,766 69,383 208,150 104,075 312,226 156,113 468,340 234,170 117,085 351,256 175,628 87,814 43,907 131,722 65,861 197,584 98,792 49,396 24,698 12,349 37,048 18,524 9,262 4,631 13,894 6,947 20,842 10,421 31,264 15,632 7,816 3,908 1,954 977 2,932 1,466 733 2,200 1,100 550 275 826 413 1,240 620 310 155 466 233 700 350 175 526

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #82,229 Browse Full Index Next Integer #82,231 →