5,651,016

2³ × 3 × 7 × 33637

5,651,016 factors as 2^3 × 3 × 7 × 33637. Its 32 positive divisors give a proper-divisor sum of 10,495,224, so this integer is abundant. The Collatz stopping time is 108 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 7 × 33637

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 16,146,240

Proper Divisor Sum 10,495,224

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #5651011 ← → #5651039

Radix Representation

Decimal	5651016
Binary	10101100011101001001000 (23 bits)
Octal	0o25435110
Hexadecimal	0x563A48

Divisor Catalog (32)

1 2 3 4 6 7 8 12 14 21 24 28 42 56 84 168 33,637 67,274 100,911 134,548 201,822 235,459 269,096 403,644 470,918 706,377 807,288 941,836 1,412,754 1,883,672 2,825,508 5,651,016

Collatz Trajectory (108 steps to reach 1)

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

5,651,016 2,825,508 1,412,754 706,377 2,119,132 1,059,566 529,783 1,589,350 794,675 2,384,026 1,192,013 3,576,040 1,788,020 894,010 447,005 1,341,016 670,508 335,254 167,627 502,882 251,441 754,324 377,162 188,581 565,744 282,872 141,436 70,718 35,359 106,078 53,039 159,118 79,559 238,678 119,339 358,018 179,009 537,028 268,514 134,257 402,772 201,386 100,693 302,080 151,040 75,520 37,760 18,880 9,440 4,720 2,360 1,180 590 295 886 443 1,330 665 1,996 998

← Previous Integer #5,651,015 Browse Full Index Next Integer #5,651,017 →