645,198

2 × 3 × 191 × 563

645,198 factors as 2 × 3 × 191 × 563. Its 16 positive divisors give a proper-divisor sum of 654,258, so this integer is abundant. The Collatz stopping time is 97 steps.

Prime Factor Structure

Factorization String 2 × 3 × 191 × 563

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,299,456

Proper Divisor Sum 654,258

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #645187 ← → #645233

Radix Representation

Decimal	645198
Binary	10011101100001001110 (20 bits)
Octal	0o2354116
Hexadecimal	0x9D84E

Divisor Catalog (16)

1 2 3 6 191 382 563 573 1,126 1,146 1,689 3,378 107,533 215,066 322,599 645,198

Collatz Trajectory (97 steps to reach 1)

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

645,198 322,599 967,798 483,899 1,451,698 725,849 2,177,548 1,088,774 544,387 1,633,162 816,581 2,449,744 1,224,872 612,436 306,218 153,109 459,328 229,664 114,832 57,416 28,708 14,354 7,177 21,532 10,766 5,383 16,150 8,075 24,226 12,113 36,340 18,170 9,085 27,256 13,628 6,814 3,407 10,222 5,111 15,334 7,667 23,002 11,501 34,504 17,252 8,626 4,313 12,940 6,470 3,235 9,706 4,853 14,560 7,280 3,640 1,820 910 455 1,366 683

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #645,197 Browse Full Index Next Integer #645,199 →