4,482,712

2³ × 13 × 43103

4,482,712 factors as 2^3 × 13 × 43103. Its 16 positive divisors give a proper-divisor sum of 4,569,128, so this integer is abundant. The Collatz stopping time is 136 steps.

Prime Factor Structure

Factorization String 2^3 × 13 × 43103

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 9,051,840

Proper Divisor Sum 4,569,128

Digit Sum / Digital Root 28 (Root: 1)

Adjacent Primes #4482703 ← → #4482721

Radix Representation

Decimal	4482712
Binary	10001000110011010011000 (23 bits)
Octal	0o21063230
Hexadecimal	0x446698

Divisor Catalog (16)

1 2 4 8 13 26 52 104 43,103 86,206 172,412 344,824 560,339 1,120,678 2,241,356 4,482,712

Collatz Trajectory (136 steps to reach 1)

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

4,482,712 2,241,356 1,120,678 560,339 1,681,018 840,509 2,521,528 1,260,764 630,382 315,191 945,574 472,787 1,418,362 709,181 2,127,544 1,063,772 531,886 265,943 797,830 398,915 1,196,746 598,373 1,795,120 897,560 448,780 224,390 112,195 336,586 168,293 504,880 252,440 126,220 63,110 31,555 94,666 47,333 142,000 71,000 35,500 17,750 8,875 26,626 13,313 39,940 19,970 9,985 29,956 14,978 7,489 22,468 11,234 5,617 16,852 8,426 4,213 12,640 6,320 3,160 1,580 790

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #4,482,711 Browse Full Index Next Integer #4,482,713 →