6,044,752

2⁴ × 7 × 31 × 1741

6,044,752 factors as 2^4 × 7 × 31 × 1741. Its 40 positive divisors give a proper-divisor sum of 7,779,760, so this integer is abundant. The Collatz stopping time is 108 steps.

Prime Factor Structure

Factorization String 2^4 × 7 × 31 × 1741

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 13,824,512

Proper Divisor Sum 7,779,760

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #6044747 ← → #6044767

Radix Representation

Decimal	6044752
Binary	10111000011110001010000 (23 bits)
Octal	0o27036120
Hexadecimal	0x5C3C50

Divisor Catalog (40)

1 2 4 7 8 14 16 28 31 56 62 112 124 217 248 434 496 868 1,736 1,741 3,472 3,482 6,964 12,187 13,928 24,374 27,856 48,748 53,971 97,496 107,942 194,992 215,884 377,797 431,768 755,594 863,536 1,511,188 3,022,376 6,044,752

Collatz Trajectory (108 steps to reach 1)

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

6,044,752 3,022,376 1,511,188 755,594 377,797 1,133,392 566,696 283,348 141,674 70,837 212,512 106,256 53,128 26,564 13,282 6,641 19,924 9,962 4,981 14,944 7,472 3,736 1,868 934 467 1,402 701 2,104 1,052 526 263 790 395 1,186 593 1,780 890 445 1,336 668 334 167 502 251 754 377 1,132 566 283 850 425 1,276 638 319 958 479 1,438 719 2,158 1,079

← Previous Integer #6,044,751 Browse Full Index Next Integer #6,044,753 →