6,966,684

2² × 3² × 431 × 449

6,966,684 factors as 2^2 × 3^2 × 431 × 449. Its 36 positive divisors give a proper-divisor sum of 10,723,716, so this integer is abundant. The Collatz stopping time is 191 steps.

Prime Factor Structure

Factorization String 2^2 × 3^2 × 431 × 449

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 17,690,400

Proper Divisor Sum 10,723,716

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #6966649 ← → #6966689

Radix Representation

Decimal	6966684
Binary	11010100100110110011100 (23 bits)
Octal	0o32446634
Hexadecimal	0x6A4D9C

Divisor Catalog (36)

1 2 3 4 6 9 12 18 36 431 449 862 898 1,293 1,347 1,724 1,796 2,586 2,694 3,879 4,041 5,172 5,388 7,758 8,082 15,516 16,164 193,519 387,038 580,557 774,076 1,161,114 1,741,671 2,322,228 3,483,342 6,966,684

Collatz Trajectory (191 steps to reach 1)

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

6,966,684 3,483,342 1,741,671 5,225,014 2,612,507 7,837,522 3,918,761 11,756,284 5,878,142 2,939,071 8,817,214 4,408,607 13,225,822 6,612,911 19,838,734 9,919,367 29,758,102 14,879,051 44,637,154 22,318,577 66,955,732 33,477,866 16,738,933 50,216,800 25,108,400 12,554,200 6,277,100 3,138,550 1,569,275 4,707,826 2,353,913 7,061,740 3,530,870 1,765,435 5,296,306 2,648,153 7,944,460 3,972,230 1,986,115 5,958,346 2,979,173 8,937,520 4,468,760 2,234,380 1,117,190 558,595 1,675,786 837,893 2,513,680 1,256,840 628,420 314,210 157,105 471,316 235,658 117,829 353,488 176,744 88,372 44,186

← Previous Integer #6,966,683 Browse Full Index Next Integer #6,966,685 →