1,896,498

2 × 3² × 105361

1,896,498 factors as 2 × 3^2 × 105361. Its 12 positive divisors give a proper-divisor sum of 2,212,620, so this integer is abundant. The Collatz stopping time is 101 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 105361

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,109,118

Proper Divisor Sum 2,212,620

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #1896473 ← → #1896527

Radix Representation

Decimal	1896498
Binary	111001111000000110010 (21 bits)
Octal	0o7170062
Hexadecimal	0x1CF032

Divisor Catalog (12)

1 2 3 6 9 18 105,361 210,722 316,083 632,166 948,249 1,896,498

Collatz Trajectory (101 steps to reach 1)

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

1,896,498 948,249 2,844,748 1,422,374 711,187 2,133,562 1,066,781 3,200,344 1,600,172 800,086 400,043 1,200,130 600,065 1,800,196 900,098 450,049 1,350,148 675,074 337,537 1,012,612 506,306 253,153 759,460 379,730 189,865 569,596 284,798 142,399 427,198 213,599 640,798 320,399 961,198 480,599 1,441,798 720,899 2,162,698 1,081,349 3,244,048 1,622,024 811,012 405,506 202,753 608,260 304,130 152,065 456,196 228,098 114,049 342,148 171,074 85,537 256,612 128,306 64,153 192,460 96,230 48,115 144,346 72,173

← Previous Integer #1,896,497 Browse Full Index Next Integer #1,896,499 →