4,346,142

2 × 3 × 227 × 3191

4,346,142 factors as 2 × 3 × 227 × 3191. Its 16 positive divisors give a proper-divisor sum of 4,387,170, so this integer is abundant. The Collatz stopping time is 66 steps.

Prime Factor Structure

Factorization String 2 × 3 × 227 × 3191

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,733,312

Proper Divisor Sum 4,387,170

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #4346141 ← → #4346161

Radix Representation

Decimal	4346142
Binary	10000100101000100011110 (23 bits)
Octal	0o20450436
Hexadecimal	0x42511E

Divisor Catalog (16)

1 2 3 6 227 454 681 1,362 3,191 6,382 9,573 19,146 724,357 1,448,714 2,173,071 4,346,142

Collatz Trajectory (66 steps to reach 1)

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

4,346,142 2,173,071 6,519,214 3,259,607 9,778,822 4,889,411 14,668,234 7,334,117 22,002,352 11,001,176 5,500,588 2,750,294 1,375,147 4,125,442 2,062,721 6,188,164 3,094,082 1,547,041 4,641,124 2,320,562 1,160,281 3,480,844 1,740,422 870,211 2,610,634 1,305,317 3,915,952 1,957,976 978,988 489,494 244,747 734,242 367,121 1,101,364 550,682 275,341 826,024 413,012 206,506 103,253 309,760 154,880 77,440 38,720 19,360 9,680 4,840 2,420 1,210 605 1,816 908 454 227 682 341 1,024 512 256 128

← Previous Integer #4,346,141 Browse Full Index Next Integer #4,346,143 →