679,028

2² × 7 × 24251

679,028 factors as 2^2 × 7 × 24251. Its 12 positive divisors give a proper-divisor sum of 679,084, so this integer is abundant. The Collatz stopping time is 154 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 24251

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 1,358,112

Proper Divisor Sum 679,084

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #678989 ← → #679033

Radix Representation

Decimal	679028
Binary	10100101110001110100 (20 bits)
Octal	0o2456164
Hexadecimal	0xA5C74

Divisor Catalog (12)

1 2 4 7 14 28 24,251 48,502 97,004 169,757 339,514 679,028

Collatz Trajectory (154 steps to reach 1)

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

679,028 339,514 169,757 509,272 254,636 127,318 63,659 190,978 95,489 286,468 143,234 71,617 214,852 107,426 53,713 161,140 80,570 40,285 120,856 60,428 30,214 15,107 45,322 22,661 67,984 33,992 16,996 8,498 4,249 12,748 6,374 3,187 9,562 4,781 14,344 7,172 3,586 1,793 5,380 2,690 1,345 4,036 2,018 1,009 3,028 1,514 757 2,272 1,136 568 284 142 71 214 107 322 161 484 242 121

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #679,027 Browse Full Index Next Integer #679,029 →