2,047,650

2 × 3 × 5² × 11 × 17 × 73

2,047,650 factors as 2 × 3 × 5^2 × 11 × 17 × 73. Its 96 positive divisors give a proper-divisor sum of 3,898,398, so this integer is abundant. The Collatz stopping time is 104 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5^2 × 11 × 17 × 73

Distinct Prime Factors 6

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 96

Divisor Sum (σ) 5,946,048

Proper Divisor Sum 3,898,398

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #2047637 ← → #2047651

Radix Representation

Decimal	2047650
Binary	111110011111010100010 (21 bits)
Octal	0o7637242
Hexadecimal	0x1F3EA2

Divisor Catalog (60 of 96)

1 2 3 5 6 10 11 15 17 22 25 30 33 34 50 51 55 66 73 75 85 102 110 146 150 165 170 187 219 255 275 330 365 374 425 438 510 550 561 730 803 825 850 935 1,095 1,122 1,241 1,275 1,606 1,650 1,825 1,870 2,190 2,409 2,482 2,550 2,805 3,650 3,723 4,015

Collatz Trajectory (104 steps to reach 1)

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

2,047,650 1,023,825 3,071,476 1,535,738 767,869 2,303,608 1,151,804 575,902 287,951 863,854 431,927 1,295,782 647,891 1,943,674 971,837 2,915,512 1,457,756 728,878 364,439 1,093,318 546,659 1,639,978 819,989 2,459,968 1,229,984 614,992 307,496 153,748 76,874 38,437 115,312 57,656 28,828 14,414 7,207 21,622 10,811 32,434 16,217 48,652 24,326 12,163 36,490 18,245 54,736 27,368 13,684 6,842 3,421 10,264 5,132 2,566 1,283 3,850 1,925 5,776 2,888 1,444 722 361

← Previous Integer #2,047,649 Browse Full Index Next Integer #2,047,651 →