568,554

2 × 3 × 7 × 13537

568,554 factors as 2 × 3 × 7 × 13537. Its 16 positive divisors give a proper-divisor sum of 731,094, so this integer is abundant. The Collatz stopping time is 84 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 13537

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,299,648

Proper Divisor Sum 731,094

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #568549 ← → #568577

Radix Representation

Decimal	568554
Binary	10001010110011101010 (20 bits)
Octal	0o2126352
Hexadecimal	0x8ACEA

Divisor Catalog (16)

1 2 3 6 7 14 21 42 13,537 27,074 40,611 81,222 94,759 189,518 284,277 568,554

Collatz Trajectory (84 steps to reach 1)

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

568,554 284,277 852,832 426,416 213,208 106,604 53,302 26,651 79,954 39,977 119,932 59,966 29,983 89,950 44,975 134,926 67,463 202,390 101,195 303,586 151,793 455,380 227,690 113,845 341,536 170,768 85,384 42,692 21,346 10,673 32,020 16,010 8,005 24,016 12,008 6,004 3,002 1,501 4,504 2,252 1,126 563 1,690 845 2,536 1,268 634 317 952 476 238 119 358 179 538 269 808 404 202 101

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

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