6,563,910

2 × 3 × 5 × 218797

6,563,910 factors as 2 × 3 × 5 × 218797. Its 16 positive divisors give a proper-divisor sum of 9,189,546, so this integer is abundant. The Collatz stopping time is 134 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 218797

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 15,753,456

Proper Divisor Sum 9,189,546

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6563867 ← → #6563929

Radix Representation

Decimal	6563910
Binary	11001000010100001000110 (23 bits)
Octal	0o31024106
Hexadecimal	0x642846

Divisor Catalog (16)

1 2 3 5 6 10 15 30 218,797 437,594 656,391 1,093,985 1,312,782 2,187,970 3,281,955 6,563,910

Collatz Trajectory (134 steps to reach 1)

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

6,563,910 3,281,955 9,845,866 4,922,933 14,768,800 7,384,400 3,692,200 1,846,100 923,050 461,525 1,384,576 692,288 346,144 173,072 86,536 43,268 21,634 10,817 32,452 16,226 8,113 24,340 12,170 6,085 18,256 9,128 4,564 2,282 1,141 3,424 1,712 856 428 214 107 322 161 484 242 121 364 182 91 274 137 412 206 103 310 155 466 233 700 350 175 526 263 790 395 1,186

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #6,563,909 Browse Full Index Next Integer #6,563,911 →