680,456

2³ × 7 × 29 × 419

680,456 factors as 2^3 × 7 × 29 × 419. Its 32 positive divisors give a proper-divisor sum of 831,544, so this integer is abundant. The Collatz stopping time is 154 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 29 × 419

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 1,512,000

Proper Divisor Sum 831,544

Digit Sum / Digital Root 29 (Root: 2)

Adjacent Primes #680453 ← → #680489

Radix Representation

Decimal	680456
Binary	10100110001000001000 (20 bits)
Octal	0o2461010
Hexadecimal	0xA6208

Divisor Catalog (32)

1 2 4 7 8 14 28 29 56 58 116 203 232 406 419 812 838 1,624 1,676 2,933 3,352 5,866 11,732 12,151 23,464 24,302 48,604 85,057 97,208 170,114 340,228 680,456

Collatz Trajectory (154 steps to reach 1)

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

680,456 340,228 170,114 85,057 255,172 127,586 63,793 191,380 95,690 47,845 143,536 71,768 35,884 17,942 8,971 26,914 13,457 40,372 20,186 10,093 30,280 15,140 7,570 3,785 11,356 5,678 2,839 8,518 4,259 12,778 6,389 19,168 9,584 4,792 2,396 1,198 599 1,798 899 2,698 1,349 4,048 2,024 1,012 506 253 760 380 190 95 286 143 430 215 646 323 970 485 1,456 728

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #680,455 Browse Full Index Next Integer #680,457 →