520,554

2 × 3 × 101 × 859

520,554 factors as 2 × 3 × 101 × 859. Its 16 positive divisors give a proper-divisor sum of 532,086, so this integer is abundant. The Collatz stopping time is 133 steps.

Prime Factor Structure

Factorization String 2 × 3 × 101 × 859

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,052,640

Proper Divisor Sum 532,086

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #520549 ← → #520567

Radix Representation

Decimal	520554
Binary	1111111000101101010 (19 bits)
Octal	0o1770552
Hexadecimal	0x7F16A

Divisor Catalog (16)

1 2 3 6 101 202 303 606 859 1,718 2,577 5,154 86,759 173,518 260,277 520,554

Collatz Trajectory (133 steps to reach 1)

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

520,554 260,277 780,832 390,416 195,208 97,604 48,802 24,401 73,204 36,602 18,301 54,904 27,452 13,726 6,863 20,590 10,295 30,886 15,443 46,330 23,165 69,496 34,748 17,374 8,687 26,062 13,031 39,094 19,547 58,642 29,321 87,964 43,982 21,991 65,974 32,987 98,962 49,481 148,444 74,222 37,111 111,334 55,667 167,002 83,501 250,504 125,252 62,626 31,313 93,940 46,970 23,485 70,456 35,228 17,614 8,807 26,422 13,211 39,634 19,817

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #520,553 Browse Full Index Next Integer #520,555 →