5,405,394

2 × 3 × 601 × 1499

5,405,394 factors as 2 × 3 × 601 × 1499. Its 16 positive divisors give a proper-divisor sum of 5,430,606, so this integer is abundant. The Collatz stopping time is 144 steps.

Prime Factor Structure

Factorization String 2 × 3 × 601 × 1499

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 10,836,000

Proper Divisor Sum 5,430,606

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #5405381 ← → #5405447

Radix Representation

Decimal	5405394
Binary	10100100111101011010010 (23 bits)
Octal	0o24475322
Hexadecimal	0x527AD2

Divisor Catalog (16)

1 2 3 6 601 1,202 1,499 1,803 2,998 3,606 4,497 8,994 900,899 1,801,798 2,702,697 5,405,394

Collatz Trajectory (144 steps to reach 1)

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

5,405,394 2,702,697 8,108,092 4,054,046 2,027,023 6,081,070 3,040,535 9,121,606 4,560,803 13,682,410 6,841,205 20,523,616 10,261,808 5,130,904 2,565,452 1,282,726 641,363 1,924,090 962,045 2,886,136 1,443,068 721,534 360,767 1,082,302 541,151 1,623,454 811,727 2,435,182 1,217,591 3,652,774 1,826,387 5,479,162 2,739,581 8,218,744 4,109,372 2,054,686 1,027,343 3,082,030 1,541,015 4,623,046 2,311,523 6,934,570 3,467,285 10,401,856 5,200,928 2,600,464 1,300,232 650,116 325,058 162,529 487,588 243,794 121,897 365,692 182,846 91,423 274,270 137,135 411,406 205,703

← Previous Integer #5,405,393 Browse Full Index Next Integer #5,405,395 →