3,744,280

2³ × 5 × 93607

3,744,280 factors as 2^3 × 5 × 93607. Its 16 positive divisors give a proper-divisor sum of 4,680,440, so this integer is abundant. The Collatz stopping time is 172 steps.

Prime Factor Structure

Factorization String 2^3 × 5 × 93607

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 8,424,720

Proper Divisor Sum 4,680,440

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #3744263 ← → #3744287

Radix Representation

Decimal	3744280
Binary	1110010010001000011000 (22 bits)
Octal	0o16221030
Hexadecimal	0x392218

Divisor Catalog (16)

1 2 4 5 8 10 20 40 93,607 187,214 374,428 468,035 748,856 936,070 1,872,140 3,744,280

Collatz Trajectory (172 steps to reach 1)

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

3,744,280 1,872,140 936,070 468,035 1,404,106 702,053 2,106,160 1,053,080 526,540 263,270 131,635 394,906 197,453 592,360 296,180 148,090 74,045 222,136 111,068 55,534 27,767 83,302 41,651 124,954 62,477 187,432 93,716 46,858 23,429 70,288 35,144 17,572 8,786 4,393 13,180 6,590 3,295 9,886 4,943 14,830 7,415 22,246 11,123 33,370 16,685 50,056 25,028 12,514 6,257 18,772 9,386 4,693 14,080 7,040 3,520 1,760 880 440 220 110

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,744,279 Browse Full Index Next Integer #3,744,281 →