281,970

2 × 3² × 5 × 13 × 241

281,970 factors as 2 × 3^2 × 5 × 13 × 241. Its 48 positive divisors give a proper-divisor sum of 510,822, so this integer is abundant. The Collatz stopping time is 83 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 5 × 13 × 241

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 792,792

Proper Divisor Sum 510,822

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #281959 ← → #281971

Radix Representation

Decimal	281970
Binary	1000100110101110010 (19 bits)
Octal	0o1046562
Hexadecimal	0x44D72

Divisor Catalog (48)

1 2 3 5 6 9 10 13 15 18 26 30 39 45 65 78 90 117 130 195 234 241 390 482 585 723 1,170 1,205 1,446 2,169 2,410 3,133 3,615 4,338 6,266 7,230 9,399 10,845 15,665 18,798 21,690 28,197 31,330 46,995 56,394 93,990 140,985 281,970

Collatz Trajectory (83 steps to reach 1)

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

281,970 140,985 422,956 211,478 105,739 317,218 158,609 475,828 237,914 118,957 356,872 178,436 89,218 44,609 133,828 66,914 33,457 100,372 50,186 25,093 75,280 37,640 18,820 9,410 4,705 14,116 7,058 3,529 10,588 5,294 2,647 7,942 3,971 11,914 5,957 17,872 8,936 4,468 2,234 1,117 3,352 1,676 838 419 1,258 629 1,888 944 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 #281,969 Browse Full Index Next Integer #281,971 →