7,109,560

2³ × 5 × 177739

7,109,560 factors as 2^3 × 5 × 177739. Its 16 positive divisors give a proper-divisor sum of 8,887,040, so this integer is abundant. The Collatz stopping time is 160 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 177739

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 15,996,600

Proper Divisor Sum 8,887,040

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #7109551 ← → #7109561

Radix Representation

Decimal	7109560
Binary	11011000111101110111000 (23 bits)
Octal	0o33075670
Hexadecimal	0x6C7BB8

Divisor Catalog (16)

1 2 4 5 8 10 20 40 177,739 355,478 710,956 888,695 1,421,912 1,777,390 3,554,780 7,109,560

Collatz Trajectory (160 steps to reach 1)

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

7,109,560 3,554,780 1,777,390 888,695 2,666,086 1,333,043 3,999,130 1,999,565 5,998,696 2,999,348 1,499,674 749,837 2,249,512 1,124,756 562,378 281,189 843,568 421,784 210,892 105,446 52,723 158,170 79,085 237,256 118,628 59,314 29,657 88,972 44,486 22,243 66,730 33,365 100,096 50,048 25,024 12,512 6,256 3,128 1,564 782 391 1,174 587 1,762 881 2,644 1,322 661 1,984 992 496 248 124 62 31 94 47 142 71 214

← Previous Integer #7,109,559 Browse Full Index Next Integer #7,109,561 →