699,088

2⁴ × 13 × 3361

699,088 factors as 2^4 × 13 × 3361. Its 20 positive divisors give a proper-divisor sum of 760,020, so this integer is abundant. The Collatz stopping time is 61 steps.

Prime Factor Structure

Factorization String 2^4 × 13 × 3361

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 1,459,108

Proper Divisor Sum 760,020

Digit Sum / Digital Root 40 (Root: 4)

Adjacent Primes #699077 ← → #699089

Radix Representation

Decimal	699088
Binary	10101010101011010000 (20 bits)
Octal	0o2525320
Hexadecimal	0xAAAD0

Divisor Catalog (20)

1 2 4 8 13 16 26 52 104 208 3,361 6,722 13,444 26,888 43,693 53,776 87,386 174,772 349,544 699,088

Collatz Trajectory (61 steps to reach 1)

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

699,088 349,544 174,772 87,386 43,693 131,080 65,540 32,770 16,385 49,156 24,578 12,289 36,868 18,434 9,217 27,652 13,826 6,913 20,740 10,370 5,185 15,556 7,778 3,889 11,668 5,834 2,917 8,752 4,376 2,188 1,094 547 1,642 821 2,464 1,232 616 308 154 77 232 116 58 29 88 44 22 11 34 17 52 26 13 40 20 10 5 16 8 4

← Previous Integer #699,087 Browse Full Index Next Integer #699,089 →