6,066,516

2² × 3 × 139 × 3637

6,066,516 factors as 2^2 × 3 × 139 × 3637. Its 24 positive divisors give a proper-divisor sum of 8,194,444, so this integer is abundant. The Collatz stopping time is 108 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 139 × 3637

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 24

Divisor Sum (σ) 14,260,960

Proper Divisor Sum 8,194,444

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6066469 ← → #6066517

Radix Representation

Decimal	6066516
Binary	10111001001000101010100 (23 bits)
Octal	0o27110524
Hexadecimal	0x5C9154

Divisor Catalog (24)

1 2 3 4 6 12 139 278 417 556 834 1,668 3,637 7,274 10,911 14,548 21,822 43,644 505,543 1,011,086 1,516,629 2,022,172 3,033,258 6,066,516

Collatz Trajectory (108 steps to reach 1)

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

6,066,516 3,033,258 1,516,629 4,549,888 2,274,944 1,137,472 568,736 284,368 142,184 71,092 35,546 17,773 53,320 26,660 13,330 6,665 19,996 9,998 4,999 14,998 7,499 22,498 11,249 33,748 16,874 8,437 25,312 12,656 6,328 3,164 1,582 791 2,374 1,187 3,562 1,781 5,344 2,672 1,336 668 334 167 502 251 754 377 1,132 566 283 850 425 1,276 638 319 958 479 1,438 719 2,158 1,079

← Previous Integer #6,066,515 Browse Full Index Next Integer #6,066,517 →