6,868,698

2 × 3 × 1144783

6,868,698 factors as 2 × 3 × 1144783. Its 8 positive divisors give a proper-divisor sum of 6,868,710, so this integer is abundant. The Collatz stopping time is 85 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1144783

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,737,408

Proper Divisor Sum 6,868,710

Digit Sum / Digital Root 51 (Root: 6)

Adjacent Primes #6868681 ← → #6868699

Radix Representation

Decimal	6868698
Binary	11010001100111011011010 (23 bits)
Octal	0o32147332
Hexadecimal	0x68CEDA

Divisor Catalog (8)

1 2 3 6 1,144,783 2,289,566 3,434,349 6,868,698

Collatz Trajectory (85 steps to reach 1)

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

6,868,698 3,434,349 10,303,048 5,151,524 2,575,762 1,287,881 3,863,644 1,931,822 965,911 2,897,734 1,448,867 4,346,602 2,173,301 6,519,904 3,259,952 1,629,976 814,988 407,494 203,747 611,242 305,621 916,864 458,432 229,216 114,608 57,304 28,652 14,326 7,163 21,490 10,745 32,236 16,118 8,059 24,178 12,089 36,268 18,134 9,067 27,202 13,601 40,804 20,402 10,201 30,604 15,302 7,651 22,954 11,477 34,432 17,216 8,608 4,304 2,152 1,076 538 269 808 404 202

← Previous Integer #6,868,697 Browse Full Index Next Integer #6,868,699 →