55,510

2 × 5 × 7 × 13 × 61

55,510 factors as 2 × 5 × 7 × 13 × 61. Its 32 positive divisors give a proper-divisor sum of 69,482, so this integer is abundant. The Collatz stopping time is 184 steps.

Prime Factor Structure

Factorization String 2 × 5 × 7 × 13 × 61

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 124,992

Proper Divisor Sum 69,482

Digit Sum / Digital Root 16 (Root: 7)

Adjacent Primes #55501 ← → #55511

Radix Representation

Decimal	55510
Binary	1101100011010110 (16 bits)
Octal	0o154326
Hexadecimal	0xD8D6

Divisor Catalog (32)

1 2 5 7 10 13 14 26 35 61 65 70 91 122 130 182 305 427 455 610 793 854 910 1,586 2,135 3,965 4,270 5,551 7,930 11,102 27,755 55,510

Collatz Trajectory (184 steps to reach 1)

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

55,510 27,755 83,266 41,633 124,900 62,450 31,225 93,676 46,838 23,419 70,258 35,129 105,388 52,694 26,347 79,042 39,521 118,564 59,282 29,641 88,924 44,462 22,231 66,694 33,347 100,042 50,021 150,064 75,032 37,516 18,758 9,379 28,138 14,069 42,208 21,104 10,552 5,276 2,638 1,319 3,958 1,979 5,938 2,969 8,908 4,454 2,227 6,682 3,341 10,024 5,012 2,506 1,253 3,760 1,880 940 470 235 706 353

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #55,509 Browse Full Index Next Integer #55,511 →