5,404,437

3² × 491 × 1223

5,404,437 factors as 3^2 × 491 × 1223. Its 12 positive divisors give a proper-divisor sum of 2,424,267, so this integer is deficient. The Collatz stopping time is 157 steps.

Prime Factor Structure

Factorization String 3^2 × 491 × 1223

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 7,828,704

Proper Divisor Sum 2,424,267

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #5404433 ← → #5404439

Radix Representation

Decimal	5404437
Binary	10100100111011100010101 (23 bits)
Octal	0o24473425
Hexadecimal	0x527715

Divisor Catalog (12)

1 3 9 491 1,223 1,473 3,669 4,419 11,007 600,493 1,801,479 5,404,437

Collatz Trajectory (157 steps to reach 1)

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

5,404,437 16,213,312 8,106,656 4,053,328 2,026,664 1,013,332 506,666 253,333 760,000 380,000 190,000 95,000 47,500 23,750 11,875 35,626 17,813 53,440 26,720 13,360 6,680 3,340 1,670 835 2,506 1,253 3,760 1,880 940 470 235 706 353 1,060 530 265 796 398 199 598 299 898 449 1,348 674 337 1,012 506 253 760 380 190 95 286 143 430 215 646 323 970

← Previous Integer #5,404,436 Browse Full Index Next Integer #5,404,438 →