696,582

2 × 3² × 38699

696,582 factors as 2 × 3^2 × 38699. Its 12 positive divisors give a proper-divisor sum of 812,718, so this integer is abundant. The Collatz stopping time is 136 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 38699

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 1,509,300

Proper Divisor Sum 812,718

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #696569 ← → #696607

Radix Representation

Decimal	696582
Binary	10101010000100000110 (20 bits)
Octal	0o2520406
Hexadecimal	0xAA106

Divisor Catalog (12)

1 2 3 6 9 18 38,699 77,398 116,097 232,194 348,291 696,582

Collatz Trajectory (136 steps to reach 1)

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

696,582 348,291 1,044,874 522,437 1,567,312 783,656 391,828 195,914 97,957 293,872 146,936 73,468 36,734 18,367 55,102 27,551 82,654 41,327 123,982 61,991 185,974 92,987 278,962 139,481 418,444 209,222 104,611 313,834 156,917 470,752 235,376 117,688 58,844 29,422 14,711 44,134 22,067 66,202 33,101 99,304 49,652 24,826 12,413 37,240 18,620 9,310 4,655 13,966 6,983 20,950 10,475 31,426 15,713 47,140 23,570 11,785 35,356 17,678 8,839 26,518

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #696,581 Browse Full Index Next Integer #696,583 →