24,679,770

2 × 3 × 5 × 521 × 1579

24,679,770 factors as 2 × 3 × 5 × 521 × 1579. Its 32 positive divisors give a proper-divisor sum of 34,702,950, so this integer is abundant. The Collatz stopping time is 198 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 521 × 1579

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 59,382,720

Proper Divisor Sum 34,702,950

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #24679769 ← → #24679771

Radix Representation

Decimal	24679770
Binary	1011110001001010101011010 (25 bits)
Octal	0o136112532
Hexadecimal	0x178955A

Divisor Catalog (32)

Collatz Trajectory (198 steps to reach 1)

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

24,679,770 12,339,885 37,019,656 18,509,828 9,254,914 4,627,457 13,882,372 6,941,186 3,470,593 10,411,780 5,205,890 2,602,945 7,808,836 3,904,418 1,952,209 5,856,628 2,928,314 1,464,157 4,392,472 2,196,236 1,098,118 549,059 1,647,178 823,589 2,470,768 1,235,384 617,692 308,846 154,423 463,270 231,635 694,906 347,453 1,042,360 521,180 260,590 130,295 390,886 195,443 586,330 293,165 879,496 439,748 219,874 109,937 329,812 164,906 82,453 247,360 123,680 61,840 30,920 15,460 7,730 3,865 11,596 5,798 2,899 8,698 4,349

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #24,679,769 Browse Full Index Next Integer #24,679,771 →