6,891,780

2² × 3 × 5 × 7 × 61 × 269

6,891,780 factors as 2^2 × 3 × 5 × 7 × 61 × 269. Its 96 positive divisors give a proper-divisor sum of 15,606,780, so this integer is abundant. The Collatz stopping time is 147 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 7 × 61 × 269

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 22,498,560

Proper Divisor Sum 15,606,780

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #6891769 ← → #6891793

Radix Representation

Decimal	6891780
Binary	11010010010100100000100 (23 bits)
Octal	0o32224404
Hexadecimal	0x692904

Divisor Catalog (60 of 96)

1 2 3 4 5 6 7 10 12 14 15 20 21 28 30 35 42 60 61 70 84 105 122 140 183 210 244 269 305 366 420 427 538 610 732 807 854 915 1,076 1,220 1,281 1,345 1,614 1,708 1,830 1,883 2,135 2,562 2,690 3,228 3,660 3,766 4,035 4,270 5,124 5,380 5,649 6,405 7,532 8,070

Collatz Trajectory (147 steps to reach 1)

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

6,891,780 3,445,890 1,722,945 5,168,836 2,584,418 1,292,209 3,876,628 1,938,314 969,157 2,907,472 1,453,736 726,868 363,434 181,717 545,152 272,576 136,288 68,144 34,072 17,036 8,518 4,259 12,778 6,389 19,168 9,584 4,792 2,396 1,198 599 1,798 899 2,698 1,349 4,048 2,024 1,012 506 253 760 380 190 95 286 143 430 215 646 323 970 485 1,456 728 364 182 91 274 137 412 206

← Previous Integer #6,891,779 Browse Full Index Next Integer #6,891,781 →