3,500,562

2 × 3 × 13 × 44879

3,500,562 factors as 2 × 3 × 13 × 44879. Its 16 positive divisors give a proper-divisor sum of 4,039,278, so this integer is abundant. The Collatz stopping time is 190 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 44879

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 7,539,840

Proper Divisor Sum 4,039,278

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #3500557 ← → #3500573

Radix Representation

Decimal	3500562
Binary	1101010110101000010010 (22 bits)
Octal	0o15265022
Hexadecimal	0x356A12

Divisor Catalog (16)

1 2 3 6 13 26 39 78 44,879 89,758 134,637 269,274 583,427 1,166,854 1,750,281 3,500,562

Collatz Trajectory (190 steps to reach 1)

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

3,500,562 1,750,281 5,250,844 2,625,422 1,312,711 3,938,134 1,969,067 5,907,202 2,953,601 8,860,804 4,430,402 2,215,201 6,645,604 3,322,802 1,661,401 4,984,204 2,492,102 1,246,051 3,738,154 1,869,077 5,607,232 2,803,616 1,401,808 700,904 350,452 175,226 87,613 262,840 131,420 65,710 32,855 98,566 49,283 147,850 73,925 221,776 110,888 55,444 27,722 13,861 41,584 20,792 10,396 5,198 2,599 7,798 3,899 11,698 5,849 17,548 8,774 4,387 13,162 6,581 19,744 9,872 4,936 2,468 1,234 617

← Previous Integer #3,500,561 Browse Full Index Next Integer #3,500,563 →