5,659,908

2² × 3 × 471659

5,659,908 factors as 2^2 × 3 × 471659. Its 12 positive divisors give a proper-divisor sum of 7,546,572, so this integer is abundant. The Collatz stopping time is 108 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 471659

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 13,206,480

Proper Divisor Sum 7,546,572

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #5659897 ← → #5659919

Radix Representation

Decimal	5659908
Binary	10101100101110100000100 (23 bits)
Octal	0o25456404
Hexadecimal	0x565D04

Divisor Catalog (12)

1 2 3 4 6 12 471,659 943,318 1,414,977 1,886,636 2,829,954 5,659,908

Collatz Trajectory (108 steps to reach 1)

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

5,659,908 2,829,954 1,414,977 4,244,932 2,122,466 1,061,233 3,183,700 1,591,850 795,925 2,387,776 1,193,888 596,944 298,472 149,236 74,618 37,309 111,928 55,964 27,982 13,991 41,974 20,987 62,962 31,481 94,444 47,222 23,611 70,834 35,417 106,252 53,126 26,563 79,690 39,845 119,536 59,768 29,884 14,942 7,471 22,414 11,207 33,622 16,811 50,434 25,217 75,652 37,826 18,913 56,740 28,370 14,185 42,556 21,278 10,639 31,918 15,959 47,878 23,939 71,818 35,909

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #5,659,907 Browse Full Index Next Integer #5,659,909 →