5,104,728

2³ × 3³ × 23633

5,104,728 factors as 2^3 × 3^3 × 23633. Its 32 positive divisors give a proper-divisor sum of 9,075,672, so this integer is abundant. The Collatz stopping time is 219 steps.

Prime Factor Structure

Factorization String 2^3 × 3^3 × 23633

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 14,180,400

Proper Divisor Sum 9,075,672

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #5104699 ← → #5104741

Radix Representation

Decimal	5104728
Binary	10011011110010001011000 (23 bits)
Octal	0o23362130
Hexadecimal	0x4DE458

Divisor Catalog (32)

1 2 3 4 6 8 9 12 18 24 27 36 54 72 108 216 23,633 47,266 70,899 94,532 141,798 189,064 212,697 283,596 425,394 567,192 638,091 850,788 1,276,182 1,701,576 2,552,364 5,104,728

Collatz Trajectory (219 steps to reach 1)

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

5,104,728 2,552,364 1,276,182 638,091 1,914,274 957,137 2,871,412 1,435,706 717,853 2,153,560 1,076,780 538,390 269,195 807,586 403,793 1,211,380 605,690 302,845 908,536 454,268 227,134 113,567 340,702 170,351 511,054 255,527 766,582 383,291 1,149,874 574,937 1,724,812 862,406 431,203 1,293,610 646,805 1,940,416 970,208 485,104 242,552 121,276 60,638 30,319 90,958 45,479 136,438 68,219 204,658 102,329 306,988 153,494 76,747 230,242 115,121 345,364 172,682 86,341 259,024 129,512 64,756 32,378

← Previous Integer #5,104,727 Browse Full Index Next Integer #5,104,729 →