6,959,466

2 × 3³ × 128879

6,959,466 factors as 2 × 3^3 × 128879. Its 16 positive divisors give a proper-divisor sum of 8,506,134, so this integer is abundant. The Collatz stopping time is 222 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 128879

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 15,465,600

Proper Divisor Sum 8,506,134

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #6959437 ← → #6959471

Radix Representation

Decimal	6959466
Binary	11010100011000101101010 (23 bits)
Octal	0o32430552
Hexadecimal	0x6A316A

Divisor Catalog (16)

1 2 3 6 9 18 27 54 128,879 257,758 386,637 773,274 1,159,911 2,319,822 3,479,733 6,959,466

Collatz Trajectory (222 steps to reach 1)

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

6,959,466 3,479,733 10,439,200 5,219,600 2,609,800 1,304,900 652,450 326,225 978,676 489,338 244,669 734,008 367,004 183,502 91,751 275,254 137,627 412,882 206,441 619,324 309,662 154,831 464,494 232,247 696,742 348,371 1,045,114 522,557 1,567,672 783,836 391,918 195,959 587,878 293,939 881,818 440,909 1,322,728 661,364 330,682 165,341 496,024 248,012 124,006 62,003 186,010 93,005 279,016 139,508 69,754 34,877 104,632 52,316 26,158 13,079 39,238 19,619 58,858 29,429 88,288 44,144

← Previous Integer #6,959,465 Browse Full Index Next Integer #6,959,467 →