6,765,416

2³ × 7 × 120811

6,765,416 factors as 2^3 × 7 × 120811. Its 16 positive divisors give a proper-divisor sum of 7,732,024, so this integer is abundant. The Collatz stopping time is 134 steps.

Prime Factor Structure

Factorization String 2^3 × 7 × 120811

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 14,497,440

Proper Divisor Sum 7,732,024

Digit Sum / Digital Root 35 (Root: 8)

Adjacent Primes #6765401 ← → #6765419

Radix Representation

Decimal	6765416
Binary	11001110011101101101000 (23 bits)
Octal	0o31635550
Hexadecimal	0x673B68

Divisor Catalog (16)

1 2 4 7 8 14 28 56 120,811 241,622 483,244 845,677 966,488 1,691,354 3,382,708 6,765,416

Collatz Trajectory (134 steps to reach 1)

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

6,765,416 3,382,708 1,691,354 845,677 2,537,032 1,268,516 634,258 317,129 951,388 475,694 237,847 713,542 356,771 1,070,314 535,157 1,605,472 802,736 401,368 200,684 100,342 50,171 150,514 75,257 225,772 112,886 56,443 169,330 84,665 253,996 126,998 63,499 190,498 95,249 285,748 142,874 71,437 214,312 107,156 53,578 26,789 80,368 40,184 20,092 10,046 5,023 15,070 7,535 22,606 11,303 33,910 16,955 50,866 25,433 76,300 38,150 19,075 57,226 28,613 85,840 42,920

← Previous Integer #6,765,415 Browse Full Index Next Integer #6,765,417 →