1,990,110

2 × 3 × 5 × 66337

1,990,110 factors as 2 × 3 × 5 × 66337. Its 16 positive divisors give a proper-divisor sum of 2,786,226, so this integer is abundant. The Collatz stopping time is 153 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 66337

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 4,776,336

Proper Divisor Sum 2,786,226

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1990103 ← → #1990111

Radix Representation

Decimal	1990110
Binary	111100101110111011110 (21 bits)
Octal	0o7456736
Hexadecimal	0x1E5DDE

Divisor Catalog (16)

1 2 3 5 6 10 15 30 66,337 132,674 199,011 331,685 398,022 663,370 995,055 1,990,110

Collatz Trajectory (153 steps to reach 1)

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

1,990,110 995,055 2,985,166 1,492,583 4,477,750 2,238,875 6,716,626 3,358,313 10,074,940 5,037,470 2,518,735 7,556,206 3,778,103 11,334,310 5,667,155 17,001,466 8,500,733 25,502,200 12,751,100 6,375,550 3,187,775 9,563,326 4,781,663 14,344,990 7,172,495 21,517,486 10,758,743 32,276,230 16,138,115 48,414,346 24,207,173 72,621,520 36,310,760 18,155,380 9,077,690 4,538,845 13,616,536 6,808,268 3,404,134 1,702,067 5,106,202 2,553,101 7,659,304 3,829,652 1,914,826 957,413 2,872,240 1,436,120 718,060 359,030 179,515 538,546 269,273 807,820 403,910 201,955 605,866 302,933 908,800 454,400

← Previous Integer #1,990,109 Browse Full Index Next Integer #1,990,111 →