1,898,700

2² × 3 × 5² × 6329

1,898,700 factors as 2^2 × 3 × 5^2 × 6329. Its 36 positive divisors give a proper-divisor sum of 3,595,740, so this integer is abundant. The Collatz stopping time is 109 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5^2 × 6329

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 36

Divisor Sum (σ) 5,494,440

Proper Divisor Sum 3,595,740

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #1898693 ← → #1898711

Radix Representation

Decimal	1898700
Binary	111001111100011001100 (21 bits)
Octal	0o7174314
Hexadecimal	0x1CF8CC

Divisor Catalog (36)

1 2 3 4 5 6 10 12 15 20 25 30 50 60 75 100 150 300 6,329 12,658 18,987 25,316 31,645 37,974 63,290 75,948 94,935 126,580 158,225 189,870 316,450 379,740 474,675 632,900 949,350 1,898,700

Collatz Trajectory (109 steps to reach 1)

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

1,898,700 949,350 474,675 1,424,026 712,013 2,136,040 1,068,020 534,010 267,005 801,016 400,508 200,254 100,127 300,382 150,191 450,574 225,287 675,862 337,931 1,013,794 506,897 1,520,692 760,346 380,173 1,140,520 570,260 285,130 142,565 427,696 213,848 106,924 53,462 26,731 80,194 40,097 120,292 60,146 30,073 90,220 45,110 22,555 67,666 33,833 101,500 50,750 25,375 76,126 38,063 114,190 57,095 171,286 85,643 256,930 128,465 385,396 192,698 96,349 289,048 144,524 72,262

← Previous Integer #1,898,699 Browse Full Index Next Integer #1,898,701 →