5,605,360

2⁴ × 5 × 70067

5,605,360 factors as 2^4 × 5 × 70067. Its 20 positive divisors give a proper-divisor sum of 7,427,288, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2^4 × 5 × 70067

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 13,032,648

Proper Divisor Sum 7,427,288

Digit Sum / Digital Root 25 (Root: 7)

Adjacent Primes #5605357 ← → #5605367

Radix Representation

Decimal	5605360
Binary	10101011000011111110000 (23 bits)
Octal	0o25303760
Hexadecimal	0x5587F0

Divisor Catalog (20)

Collatz Trajectory (95 steps to reach 1)

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

5,605,360 2,802,680 1,401,340 700,670 350,335 1,051,006 525,503 1,576,510 788,255 2,364,766 1,182,383 3,547,150 1,773,575 5,320,726 2,660,363 7,981,090 3,990,545 11,971,636 5,985,818 2,992,909 8,978,728 4,489,364 2,244,682 1,122,341 3,367,024 1,683,512 841,756 420,878 210,439 631,318 315,659 946,978 473,489 1,420,468 710,234 355,117 1,065,352 532,676 266,338 133,169 399,508 199,754 99,877 299,632 149,816 74,908 37,454 18,727 56,182 28,091 84,274 42,137 126,412 63,206 31,603 94,810 47,405 142,216 71,108 35,554

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,605,359 Browse Full Index Next Integer #5,605,361 →