6,970,026

2 × 3 × 7 × 263 × 631

6,970,026 factors as 2 × 3 × 7 × 263 × 631. Its 32 positive divisors give a proper-divisor sum of 9,047,382, so this integer is abundant. The Collatz stopping time is 72 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 263 × 631

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 16,017,408

Proper Divisor Sum 9,047,382

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6970013 ← → #6970037

Radix Representation

Decimal	6970026
Binary	11010100101101010101010 (23 bits)
Octal	0o32455252
Hexadecimal	0x6A5AAA

Divisor Catalog (32)

1 2 3 6 7 14 21 42 263 526 631 789 1,262 1,578 1,841 1,893 3,682 3,786 4,417 5,523 8,834 11,046 13,251 26,502 165,953 331,906 497,859 995,718 1,161,671 2,323,342 3,485,013 6,970,026

Collatz Trajectory (72 steps to reach 1)

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

6,970,026 3,485,013 10,455,040 5,227,520 2,613,760 1,306,880 653,440 326,720 163,360 81,680 40,840 20,420 10,210 5,105 15,316 7,658 3,829 11,488 5,744 2,872 1,436 718 359 1,078 539 1,618 809 2,428 1,214 607 1,822 911 2,734 1,367 4,102 2,051 6,154 3,077 9,232 4,616 2,308 1,154 577 1,732 866 433 1,300 650 325 976 488 244 122 61 184 92 46 23 70 35

← Previous Integer #6,970,025 Browse Full Index Next Integer #6,970,027 →