643,758

2 × 3 × 19 × 5647

643,758 factors as 2 × 3 × 19 × 5647. Its 16 positive divisors give a proper-divisor sum of 711,762, so this integer is abundant. The Collatz stopping time is 123 steps.

Prime Factor Structure

Factorization String 2 × 3 × 19 × 5647

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,355,520

Proper Divisor Sum 711,762

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #643751 ← → #643781

Radix Representation

Decimal	643758
Binary	10011101001010101110 (20 bits)
Octal	0o2351256
Hexadecimal	0x9D2AE

Divisor Catalog (16)

1 2 3 6 19 38 57 114 5,647 11,294 16,941 33,882 107,293 214,586 321,879 643,758

Collatz Trajectory (123 steps to reach 1)

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

643,758 321,879 965,638 482,819 1,448,458 724,229 2,172,688 1,086,344 543,172 271,586 135,793 407,380 203,690 101,845 305,536 152,768 76,384 38,192 19,096 9,548 4,774 2,387 7,162 3,581 10,744 5,372 2,686 1,343 4,030 2,015 6,046 3,023 9,070 4,535 13,606 6,803 20,410 10,205 30,616 15,308 7,654 3,827 11,482 5,741 17,224 8,612 4,306 2,153 6,460 3,230 1,615 4,846 2,423 7,270 3,635 10,906 5,453 16,360 8,180 4,090

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #643,757 Browse Full Index Next Integer #643,759 →