1,997,148

2² × 3 × 166429

1,997,148 factors as 2^2 × 3 × 166429. Its 12 positive divisors give a proper-divisor sum of 2,662,892, so this integer is abundant. The Collatz stopping time is 153 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 166429

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 4,660,040

Proper Divisor Sum 2,662,892

Digit Sum / Digital Root 39 (Root: 3)

Adjacent Primes #1997141 ← → #1997161

Radix Representation

Decimal	1997148
Binary	111100111100101011100 (21 bits)
Octal	0o7474534
Hexadecimal	0x1E795C

Divisor Catalog (12)

1 2 3 4 6 12 166,429 332,858 499,287 665,716 998,574 1,997,148

Collatz Trajectory (153 steps to reach 1)

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

1,997,148 998,574 499,287 1,497,862 748,931 2,246,794 1,123,397 3,370,192 1,685,096 842,548 421,274 210,637 631,912 315,956 157,978 78,989 236,968 118,484 59,242 29,621 88,864 44,432 22,216 11,108 5,554 2,777 8,332 4,166 2,083 6,250 3,125 9,376 4,688 2,344 1,172 586 293 880 440 220 110 55 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121 364

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,997,147 Browse Full Index Next Integer #1,997,149 →