5,360,664

2³ × 3 × 223361

5,360,664 factors as 2^3 × 3 × 223361. Its 16 positive divisors give a proper-divisor sum of 8,041,056, so this integer is abundant. The Collatz stopping time is 95 steps.

Prime Factor Structure

Factorization String 2^3 × 3 × 223361

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 13,401,720

Proper Divisor Sum 8,041,056

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #5360657 ← → #5360669

Radix Representation

Decimal	5360664
Binary	10100011100110000011000 (23 bits)
Octal	0o24346030
Hexadecimal	0x51CC18

Divisor Catalog (16)

1 2 3 4 6 8 12 24 223,361 446,722 670,083 893,444 1,340,166 1,786,888 2,680,332 5,360,664

Collatz Trajectory (95 steps to reach 1)

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

5,360,664 2,680,332 1,340,166 670,083 2,010,250 1,005,125 3,015,376 1,507,688 753,844 376,922 188,461 565,384 282,692 141,346 70,673 212,020 106,010 53,005 159,016 79,508 39,754 19,877 59,632 29,816 14,908 7,454 3,727 11,182 5,591 16,774 8,387 25,162 12,581 37,744 18,872 9,436 4,718 2,359 7,078 3,539 10,618 5,309 15,928 7,964 3,982 1,991 5,974 2,987 8,962 4,481 13,444 6,722 3,361 10,084 5,042 2,521 7,564 3,782 1,891 5,674

← Previous Integer #5,360,663 Browse Full Index Next Integer #5,360,665 →