274,374

2 × 3³ × 5081

274,374 factors as 2 × 3^3 × 5081. Its 16 positive divisors give a proper-divisor sum of 335,466, so this integer is abundant. The Collatz stopping time is 176 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 5081

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 609,840

Proper Divisor Sum 335,466

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #274361 ← → #274403

Radix Representation

Decimal	274374
Binary	1000010111111000110 (19 bits)
Octal	0o1027706
Hexadecimal	0x42FC6

Divisor Catalog (16)

1 2 3 6 9 18 27 54 5,081 10,162 15,243 30,486 45,729 91,458 137,187 274,374

Collatz Trajectory (176 steps to reach 1)

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

274,374 137,187 411,562 205,781 617,344 308,672 154,336 77,168 38,584 19,292 9,646 4,823 14,470 7,235 21,706 10,853 32,560 16,280 8,140 4,070 2,035 6,106 3,053 9,160 4,580 2,290 1,145 3,436 1,718 859 2,578 1,289 3,868 1,934 967 2,902 1,451 4,354 2,177 6,532 3,266 1,633 4,900 2,450 1,225 3,676 1,838 919 2,758 1,379 4,138 2,069 6,208 3,104 1,552 776 388 194 97 292

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #274,373 Browse Full Index Next Integer #274,375 →