2,671,254

2 × 3² × 148403

2,671,254 factors as 2 × 3^2 × 148403. Its 12 positive divisors give a proper-divisor sum of 3,116,502, so this integer is abundant. The Collatz stopping time is 156 steps.

Prime Factor Structure

Factorization String 2 × 3^2 × 148403

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 5,787,756

Proper Divisor Sum 3,116,502

Digit Sum / Digital Root 27 (Root: 9)

Adjacent Primes #2671241 ← → #2671271

Radix Representation

Decimal	2671254
Binary	1010001100001010010110 (22 bits)
Octal	0o12141226
Hexadecimal	0x28C296

Divisor Catalog (12)

1 2 3 6 9 18 148,403 296,806 445,209 890,418 1,335,627 2,671,254

Collatz Trajectory (156 steps to reach 1)

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

2,671,254 1,335,627 4,006,882 2,003,441 6,010,324 3,005,162 1,502,581 4,507,744 2,253,872 1,126,936 563,468 281,734 140,867 422,602 211,301 633,904 316,952 158,476 79,238 39,619 118,858 59,429 178,288 89,144 44,572 22,286 11,143 33,430 16,715 50,146 25,073 75,220 37,610 18,805 56,416 28,208 14,104 7,052 3,526 1,763 5,290 2,645 7,936 3,968 1,984 992 496 248 124 62 31 94 47 142 71 214 107 322 161 484

← Previous Integer #2,671,253 Browse Full Index Next Integer #2,671,255 →