5,654,670

2 × 3 × 5 × 7 × 26927

5,654,670 factors as 2 × 3 × 5 × 7 × 26927. Its 32 positive divisors give a proper-divisor sum of 9,855,858, so this integer is abundant. The Collatz stopping time is 152 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 7 × 26927

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 15,510,528

Proper Divisor Sum 9,855,858

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #5654657 ← → #5654689

Radix Representation

Decimal	5654670
Binary	10101100100100010001110 (23 bits)
Octal	0o25444216
Hexadecimal	0x56488E

Divisor Catalog (32)

1 2 3 5 6 7 10 14 15 21 30 35 42 70 105 210 26,927 53,854 80,781 134,635 161,562 188,489 269,270 376,978 403,905 565,467 807,810 942,445 1,130,934 1,884,890 2,827,335 5,654,670

Collatz Trajectory (152 steps to reach 1)

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

5,654,670 2,827,335 8,482,006 4,241,003 12,723,010 6,361,505 19,084,516 9,542,258 4,771,129 14,313,388 7,156,694 3,578,347 10,735,042 5,367,521 16,102,564 8,051,282 4,025,641 12,076,924 6,038,462 3,019,231 9,057,694 4,528,847 13,586,542 6,793,271 20,379,814 10,189,907 30,569,722 15,284,861 45,854,584 22,927,292 11,463,646 5,731,823 17,195,470 8,597,735 25,793,206 12,896,603 38,689,810 19,344,905 58,034,716 29,017,358 14,508,679 43,526,038 21,763,019 65,289,058 32,644,529 97,933,588 48,966,794 24,483,397 73,450,192 36,725,096 18,362,548 9,181,274 4,590,637 13,771,912 6,885,956 3,442,978 1,721,489 5,164,468 2,582,234 1,291,117

← Previous Integer #5,654,669 Browse Full Index Next Integer #5,654,671 →