6,200,508

2² × 3 × 516709

6,200,508 factors as 2^2 × 3 × 516709. Its 12 positive divisors give a proper-divisor sum of 8,267,372, so this integer is abundant. The Collatz stopping time is 51 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 516709

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 14,467,880

Proper Divisor Sum 8,267,372

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #6200507 ← → #6200539

Radix Representation

Decimal	6200508
Binary	10111101001110010111100 (23 bits)
Octal	0o27516274
Hexadecimal	0x5E9CBC

Divisor Catalog (12)

1 2 3 4 6 12 516,709 1,033,418 1,550,127 2,066,836 3,100,254 6,200,508

Collatz Trajectory (51 steps to reach 1)

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

6,200,508 3,100,254 1,550,127 4,650,382 2,325,191 6,975,574 3,487,787 10,463,362 5,231,681 15,695,044 7,847,522 3,923,761 11,771,284 5,885,642 2,942,821 8,828,464 4,414,232 2,207,116 1,103,558 551,779 1,655,338 827,669 2,483,008 1,241,504 620,752 310,376 155,188 77,594 38,797 116,392 58,196 29,098 14,549 43,648 21,824 10,912 5,456 2,728 1,364 682 341 1,024 512 256 128 64 32 16 8 4 2 1

← Previous Integer #6,200,507 Browse Full Index Next Integer #6,200,509 →