5,607,552

2⁷ × 3 × 17 × 859

5,607,552 factors as 2^7 × 3 × 17 × 859. Its 64 positive divisors give a proper-divisor sum of 10,182,048, so this integer is abundant. The Collatz stopping time is 170 steps.

Prime Factor Structure

Factorization String 2^7 × 3 × 17 × 859

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 64

Divisor Sum (σ) 15,789,600

Proper Divisor Sum 10,182,048

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #5607551 ← → #5607571

Radix Representation

Decimal	5607552
Binary	10101011001000010000000 (23 bits)
Octal	0o25310200
Hexadecimal	0x559080

Divisor Catalog (60 of 64)

1 2 3 4 6 8 12 16 17 24 32 34 48 51 64 68 96 102 128 136 192 204 272 384 408 544 816 859 1,088 1,632 1,718 2,176 2,577 3,264 3,436 5,154 6,528 6,872 10,308 13,744 14,603 20,616 27,488 29,206 41,232 43,809 54,976 58,412 82,464 87,618 109,952 116,824 164,928 175,236 233,648 329,856 350,472 467,296 700,944 934,592

Collatz Trajectory (170 steps to reach 1)

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

5,607,552 2,803,776 1,401,888 700,944 350,472 175,236 87,618 43,809 131,428 65,714 32,857 98,572 49,286 24,643 73,930 36,965 110,896 55,448 27,724 13,862 6,931 20,794 10,397 31,192 15,596 7,798 3,899 11,698 5,849 17,548 8,774 4,387 13,162 6,581 19,744 9,872 4,936 2,468 1,234 617 1,852 926 463 1,390 695 2,086 1,043 3,130 1,565 4,696 2,348 1,174 587 1,762 881 2,644 1,322 661 1,984 992

← Previous Integer #5,607,551 Browse Full Index Next Integer #5,607,553 →