3,225,522

2 × 3 × 537587

3,225,522 factors as 2 × 3 × 537587. Its 8 positive divisors give a proper-divisor sum of 3,225,534, so this integer is abundant. The Collatz stopping time is 71 steps.

Prime Factor Structure

Factorization String 2 × 3 × 537587

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 6,451,056

Proper Divisor Sum 3,225,534

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #3225517 ← → #3225539

Radix Representation

Decimal	3225522
Binary	1100010011011110110010 (22 bits)
Octal	0o14233662
Hexadecimal	0x3137B2

Divisor Catalog (8)

1 2 3 6 537,587 1,075,174 1,612,761 3,225,522

Collatz Trajectory (71 steps to reach 1)

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

3,225,522 1,612,761 4,838,284 2,419,142 1,209,571 3,628,714 1,814,357 5,443,072 2,721,536 1,360,768 680,384 340,192 170,096 85,048 42,524 21,262 10,631 31,894 15,947 47,842 23,921 71,764 35,882 17,941 53,824 26,912 13,456 6,728 3,364 1,682 841 2,524 1,262 631 1,894 947 2,842 1,421 4,264 2,132 1,066 533 1,600 800 400 200 100 50 25 76 38 19 58 29 88 44 22 11 34 17

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #3,225,521 Browse Full Index Next Integer #3,225,523 →