698,460

2² × 3 × 5 × 7 × 1663

698,460 factors as 2^2 × 3 × 5 × 7 × 1663. Its 48 positive divisors give a proper-divisor sum of 1,537,956, so this integer is abundant. The Collatz stopping time is 79 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 7 × 1663

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 2,236,416

Proper Divisor Sum 1,537,956

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #698447 ← → #698471

Radix Representation

Decimal	698460
Binary	10101010100001011100 (20 bits)
Octal	0o2524134
Hexadecimal	0xAA85C

Divisor Catalog (48)

1 2 3 4 5 6 7 10 12 14 15 20 21 28 30 35 42 60 70 84 105 140 210 420 1,663 3,326 4,989 6,652 8,315 9,978 11,641 16,630 19,956 23,282 24,945 33,260 34,923 46,564 49,890 58,205 69,846 99,780 116,410 139,692 174,615 232,820 349,230 698,460

Collatz Trajectory (79 steps to reach 1)

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

698,460 349,230 174,615 523,846 261,923 785,770 392,885 1,178,656 589,328 294,664 147,332 73,666 36,833 110,500 55,250 27,625 82,876 41,438 20,719 62,158 31,079 93,238 46,619 139,858 69,929 209,788 104,894 52,447 157,342 78,671 236,014 118,007 354,022 177,011 531,034 265,517 796,552 398,276 199,138 99,569 298,708 149,354 74,677 224,032 112,016 56,008 28,004 14,002 7,001 21,004 10,502 5,251 15,754 7,877 23,632 11,816 5,908 2,954 1,477 4,432

← Previous Integer #698,459 Browse Full Index Next Integer #698,461 →