6,763,986

2 × 3⁴ × 43 × 971

6,763,986 factors as 2 × 3^4 × 43 × 971. Its 40 positive divisors give a proper-divisor sum of 8,760,798, so this integer is abundant. The Collatz stopping time is 108 steps.

Prime Factor Structure

Factorization String 2 × 3^4 × 43 × 971

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 15,524,784

Proper Divisor Sum 8,760,798

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #6763979 ← → #6763987

Radix Representation

Decimal	6763986
Binary	11001110011010111010010 (23 bits)
Octal	0o31632722
Hexadecimal	0x6735D2

Divisor Catalog (40)

1 2 3 6 9 18 27 43 54 81 86 129 162 258 387 774 971 1,161 1,942 2,322 2,913 3,483 5,826 6,966 8,739 17,478 26,217 41,753 52,434 78,651 83,506 125,259 157,302 250,518 375,777 751,554 1,127,331 2,254,662 3,381,993 6,763,986

Collatz Trajectory (108 steps to reach 1)

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

6,763,986 3,381,993 10,145,980 5,072,990 2,536,495 7,609,486 3,804,743 11,414,230 5,707,115 17,121,346 8,560,673 25,682,020 12,841,010 6,420,505 19,261,516 9,630,758 4,815,379 14,446,138 7,223,069 21,669,208 10,834,604 5,417,302 2,708,651 8,125,954 4,062,977 12,188,932 6,094,466 3,047,233 9,141,700 4,570,850 2,285,425 6,856,276 3,428,138 1,714,069 5,142,208 2,571,104 1,285,552 642,776 321,388 160,694 80,347 241,042 120,521 361,564 180,782 90,391 271,174 135,587 406,762 203,381 610,144 305,072 152,536 76,268 38,134 19,067 57,202 28,601 85,804 42,902

← Previous Integer #6,763,985 Browse Full Index Next Integer #6,763,987 →