3,573,050

2 × 5² × 13 × 23 × 239

3,573,050 factors as 2 × 5^2 × 13 × 23 × 239. Its 48 positive divisors give a proper-divisor sum of 3,926,470, so this integer is abundant. The Collatz stopping time is 146 steps.

Prime Factor Structure

Factorization String 2 × 5^2 × 13 × 23 × 239

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 7,499,520

Proper Divisor Sum 3,926,470

Digit Sum / Digital Root 23 (Root: 5)

Adjacent Primes #3573049 ← → #3573107

Radix Representation

Decimal	3573050
Binary	1101101000010100111010 (22 bits)
Octal	0o15502472
Hexadecimal	0x36853A

Divisor Catalog (48)

1 2 5 10 13 23 25 26 46 50 65 115 130 230 239 299 325 478 575 598 650 1,150 1,195 1,495 2,390 2,990 3,107 5,497 5,975 6,214 7,475 10,994 11,950 14,950 15,535 27,485 31,070 54,970 71,461 77,675 137,425 142,922 155,350 274,850 357,305 714,610 1,786,525 3,573,050

Collatz Trajectory (146 steps to reach 1)

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

3,573,050 1,786,525 5,359,576 2,679,788 1,339,894 669,947 2,009,842 1,004,921 3,014,764 1,507,382 753,691 2,261,074 1,130,537 3,391,612 1,695,806 847,903 2,543,710 1,271,855 3,815,566 1,907,783 5,723,350 2,861,675 8,585,026 4,292,513 12,877,540 6,438,770 3,219,385 9,658,156 4,829,078 2,414,539 7,243,618 3,621,809 10,865,428 5,432,714 2,716,357 8,149,072 4,074,536 2,037,268 1,018,634 509,317 1,527,952 763,976 381,988 190,994 95,497 286,492 143,246 71,623 214,870 107,435 322,306 161,153 483,460 241,730 120,865 362,596 181,298 90,649 271,948 135,974

← Previous Integer #3,573,049 Browse Full Index Next Integer #3,573,051 →