6,920,040

2³ × 3 × 5 × 57667

6,920,040 factors as 2^3 × 3 × 5 × 57667. Its 32 positive divisors give a proper-divisor sum of 13,840,440, so this integer is abundant. The Collatz stopping time is 98 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 5 × 57667

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 20,760,480

Proper Divisor Sum 13,840,440

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #6919993 ← → #6920041

Radix Representation

Decimal	6920040
Binary	11010011001011101101000 (23 bits)
Octal	0o32313550
Hexadecimal	0x699768

Divisor Catalog (32)

1 2 3 4 5 6 8 10 12 15 20 24 30 40 60 120 57,667 115,334 173,001 230,668 288,335 346,002 461,336 576,670 692,004 865,005 1,153,340 1,384,008 1,730,010 2,306,680 3,460,020 6,920,040

Collatz Trajectory (98 steps to reach 1)

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

6,920,040 3,460,020 1,730,010 865,005 2,595,016 1,297,508 648,754 324,377 973,132 486,566 243,283 729,850 364,925 1,094,776 547,388 273,694 136,847 410,542 205,271 615,814 307,907 923,722 461,861 1,385,584 692,792 346,396 173,198 86,599 259,798 129,899 389,698 194,849 584,548 292,274 146,137 438,412 219,206 109,603 328,810 164,405 493,216 246,608 123,304 61,652 30,826 15,413 46,240 23,120 11,560 5,780 2,890 1,445 4,336 2,168 1,084 542 271 814 407 1,222

← Previous Integer #6,920,039 Browse Full Index Next Integer #6,920,041 →