5,489,744

2⁴ × 13 × 26393

5,489,744 factors as 2^4 × 13 × 26393. Its 20 positive divisors give a proper-divisor sum of 5,965,252, so this integer is abundant. The Collatz stopping time is 108 steps.

Prime Factor Structure

Factorization String 2^4 × 13 × 26393

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 20

Divisor Sum (σ) 11,454,996

Proper Divisor Sum 5,965,252

Digit Sum / Digital Root 41 (Root: 5)

Adjacent Primes #5489723 ← → #5489747

Radix Representation

Decimal	5489744
Binary	10100111100010001010000 (23 bits)
Octal	0o24742120
Hexadecimal	0x53C450

Divisor Catalog (20)

Collatz Trajectory (108 steps to reach 1)

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

5,489,744 2,744,872 1,372,436 686,218 343,109 1,029,328 514,664 257,332 128,666 64,333 193,000 96,500 48,250 24,125 72,376 36,188 18,094 9,047 27,142 13,571 40,714 20,357 61,072 30,536 15,268 7,634 3,817 11,452 5,726 2,863 8,590 4,295 12,886 6,443 19,330 9,665 28,996 14,498 7,249 21,748 10,874 5,437 16,312 8,156 4,078 2,039 6,118 3,059 9,178 4,589 13,768 6,884 3,442 1,721 5,164 2,582 1,291 3,874 1,937 5,812

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,489,743 Browse Full Index Next Integer #5,489,745 →