2,338,500

2² × 3 × 5³ × 1559

2,338,500 factors as 2^2 × 3 × 5^3 × 1559. Its 48 positive divisors give a proper-divisor sum of 4,475,580, so this integer is abundant. The Collatz stopping time is 86 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5^3 × 1559

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 6,814,080

Proper Divisor Sum 4,475,580

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #2338493 ← → #2338507

Radix Representation

Decimal	2338500
Binary	1000111010111011000100 (22 bits)
Octal	0o10727304
Hexadecimal	0x23AEC4

Divisor Catalog (48)

1 2 3 4 5 6 10 12 15 20 25 30 50 60 75 100 125 150 250 300 375 500 750 1,500 1,559 3,118 4,677 6,236 7,795 9,354 15,590 18,708 23,385 31,180 38,975 46,770 77,950 93,540 116,925 155,900 194,875 233,850 389,750 467,700 584,625 779,500 1,169,250 2,338,500

Collatz Trajectory (86 steps to reach 1)

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

2,338,500 1,169,250 584,625 1,753,876 876,938 438,469 1,315,408 657,704 328,852 164,426 82,213 246,640 123,320 61,660 30,830 15,415 46,246 23,123 69,370 34,685 104,056 52,028 26,014 13,007 39,022 19,511 58,534 29,267 87,802 43,901 131,704 65,852 32,926 16,463 49,390 24,695 74,086 37,043 111,130 55,565 166,696 83,348 41,674 20,837 62,512 31,256 15,628 7,814 3,907 11,722 5,861 17,584 8,792 4,396 2,198 1,099 3,298 1,649 4,948 2,474

← Previous Integer #2,338,499 Browse Full Index Next Integer #2,338,501 →