6,966,006

2 × 3 × 1161001

6,966,006 factors as 2 × 3 × 1161001. Its 8 positive divisors give a proper-divisor sum of 6,966,018, so this integer is abundant. The Collatz stopping time is 129 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1161001

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 13,932,024

Proper Divisor Sum 6,966,018

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6965977 ← → #6966007

Radix Representation

Decimal	6966006
Binary	11010100100101011110110 (23 bits)
Octal	0o32445366
Hexadecimal	0x6A4AF6

Divisor Catalog (8)

1 2 3 6 1,161,001 2,322,002 3,483,003 6,966,006

Collatz Trajectory (129 steps to reach 1)

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

6,966,006 3,483,003 10,449,010 5,224,505 15,673,516 7,836,758 3,918,379 11,755,138 5,877,569 17,632,708 8,816,354 4,408,177 13,224,532 6,612,266 3,306,133 9,918,400 4,959,200 2,479,600 1,239,800 619,900 309,950 154,975 464,926 232,463 697,390 348,695 1,046,086 523,043 1,569,130 784,565 2,353,696 1,176,848 588,424 294,212 147,106 73,553 220,660 110,330 55,165 165,496 82,748 41,374 20,687 62,062 31,031 93,094 46,547 139,642 69,821 209,464 104,732 52,366 26,183 78,550 39,275 117,826 58,913 176,740 88,370 44,185

← Previous Integer #6,966,005 Browse Full Index Next Integer #6,966,007 →