439,182

2 × 3⁴ × 2711

439,182 factors as 2 × 3^4 × 2711. Its 20 positive divisors give a proper-divisor sum of 545,274, so this integer is abundant. The Collatz stopping time is 94 steps.

Prime Factor Structure

Factorization String 2 × 3^4 × 2711

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 984,456

Proper Divisor Sum 545,274

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #439171 ← → #439183

Radix Representation

Decimal	439182
Binary	1101011001110001110 (19 bits)
Octal	0o1531616
Hexadecimal	0x6B38E

Divisor Catalog (20)

1 2 3 6 9 18 27 54 81 162 2,711 5,422 8,133 16,266 24,399 48,798 73,197 146,394 219,591 439,182

Collatz Trajectory (94 steps to reach 1)

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

439,182 219,591 658,774 329,387 988,162 494,081 1,482,244 741,122 370,561 1,111,684 555,842 277,921 833,764 416,882 208,441 625,324 312,662 156,331 468,994 234,497 703,492 351,746 175,873 527,620 263,810 131,905 395,716 197,858 98,929 296,788 148,394 74,197 222,592 111,296 55,648 27,824 13,912 6,956 3,478 1,739 5,218 2,609 7,828 3,914 1,957 5,872 2,936 1,468 734 367 1,102 551 1,654 827 2,482 1,241 3,724 1,862 931 2,794

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #439,181 Browse Full Index Next Integer #439,183 →