626,802

2 × 3 × 11 × 9497

626,802 factors as 2 × 3 × 11 × 9497. Its 16 positive divisors give a proper-divisor sum of 740,910, so this integer is abundant. The Collatz stopping time is 172 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 9497

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,367,712

Proper Divisor Sum 740,910

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #626797 ← → #626809

Radix Representation

Decimal	626802
Binary	10011001000001110010 (20 bits)
Octal	0o2310162
Hexadecimal	0x99072

Divisor Catalog (16)

1 2 3 6 11 22 33 66 9,497 18,994 28,491 56,982 104,467 208,934 313,401 626,802

Collatz Trajectory (172 steps to reach 1)

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

626,802 313,401 940,204 470,102 235,051 705,154 352,577 1,057,732 528,866 264,433 793,300 396,650 198,325 594,976 297,488 148,744 74,372 37,186 18,593 55,780 27,890 13,945 41,836 20,918 10,459 31,378 15,689 47,068 23,534 11,767 35,302 17,651 52,954 26,477 79,432 39,716 19,858 9,929 29,788 14,894 7,447 22,342 11,171 33,514 16,757 50,272 25,136 12,568 6,284 3,142 1,571 4,714 2,357 7,072 3,536 1,768 884 442 221 664

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #626,801 Browse Full Index Next Integer #626,803 →