13,487,572

2² × 7 × 481699

13,487,572 factors as 2^2 × 7 × 481699. Its 12 positive divisors give a proper-divisor sum of 13,487,628, so this integer is abundant. The Collatz stopping time is 135 steps.

Prime Factor Structure

Factorization String 2^2 × 7 × 481699

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 26,975,200

Proper Divisor Sum 13,487,628

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #13487563 ← → #13487597

Radix Representation

Decimal	13487572
Binary	110011011100110111010100 (24 bits)
Octal	0o63346724
Hexadecimal	0xCDCDD4

Divisor Catalog (12)

1 2 4 7 14 28 481,699 963,398 1,926,796 3,371,893 6,743,786 13,487,572

Collatz Trajectory (135 steps to reach 1)

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

13,487,572 6,743,786 3,371,893 10,115,680 5,057,840 2,528,920 1,264,460 632,230 316,115 948,346 474,173 1,422,520 711,260 355,630 177,815 533,446 266,723 800,170 400,085 1,200,256 600,128 300,064 150,032 75,016 37,508 18,754 9,377 28,132 14,066 7,033 21,100 10,550 5,275 15,826 7,913 23,740 11,870 5,935 17,806 8,903 26,710 13,355 40,066 20,033 60,100 30,050 15,025 45,076 22,538 11,269 33,808 16,904 8,452 4,226 2,113 6,340 3,170 1,585 4,756 2,378

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #13,487,571 Browse Full Index Next Integer #13,487,573 →