5,744,478

2 × 3 × 957413

5,744,478 factors as 2 × 3 × 957413. Its 8 positive divisors give a proper-divisor sum of 5,744,490, so this integer is abundant. The Collatz stopping time is 121 steps.

Prime Factor Structure

Factorization String 2 × 3 × 957413

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 11,488,968

Proper Divisor Sum 5,744,490

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #5744477 ← → #5744507

Radix Representation

Decimal	5744478
Binary	10101111010011101011110 (23 bits)
Octal	0o25723536
Hexadecimal	0x57A75E

Divisor Catalog (8)

1 2 3 6 957,413 1,914,826 2,872,239 5,744,478

Collatz Trajectory (121 steps to reach 1)

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

5,744,478 2,872,239 8,616,718 4,308,359 12,925,078 6,462,539 19,387,618 9,693,809 29,081,428 14,540,714 7,270,357 21,811,072 10,905,536 5,452,768 2,726,384 1,363,192 681,596 340,798 170,399 511,198 255,599 766,798 383,399 1,150,198 575,099 1,725,298 862,649 2,587,948 1,293,974 646,987 1,940,962 970,481 2,911,444 1,455,722 727,861 2,183,584 1,091,792 545,896 272,948 136,474 68,237 204,712 102,356 51,178 25,589 76,768 38,384 19,192 9,596 4,798 2,399 7,198 3,599 10,798 5,399 16,198 8,099 24,298 12,149 36,448

← Previous Integer #5,744,477 Browse Full Index Next Integer #5,744,479 →