439,068

2² × 3 × 7 × 5227

439,068 factors as 2^2 × 3 × 7 × 5227. Its 24 positive divisors give a proper-divisor sum of 732,004, so this integer is abundant. The Collatz stopping time is 68 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 7 × 5227

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 1,171,072

Proper Divisor Sum 732,004

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #439063 ← → #439081

Radix Representation

Decimal	439068
Binary	1101011001100011100 (19 bits)
Octal	0o1531434
Hexadecimal	0x6B31C

Divisor Catalog (24)

Collatz Trajectory (68 steps to reach 1)

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

439,068 219,534 109,767 329,302 164,651 493,954 246,977 740,932 370,466 185,233 555,700 277,850 138,925 416,776 208,388 104,194 52,097 156,292 78,146 39,073 117,220 58,610 29,305 87,916 43,958 21,979 65,938 32,969 98,908 49,454 24,727 74,182 37,091 111,274 55,637 166,912 83,456 41,728 20,864 10,432 5,216 2,608 1,304 652 326 163 490 245 736 368 184 92 46 23 70 35 106 53 160 80

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #439,067 Browse Full Index Next Integer #439,069 →