6,050,958

2 × 3 × 1008493

6,050,958 factors as 2 × 3 × 1008493. Its 8 positive divisors give a proper-divisor sum of 6,050,970, so this integer is abundant. The Collatz stopping time is 90 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1008493

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 12,101,928

Proper Divisor Sum 6,050,970

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6050953 ← → #6050959

Radix Representation

Decimal	6050958
Binary	10111000101010010001110 (23 bits)
Octal	0o27052216
Hexadecimal	0x5C548E

Divisor Catalog (8)

1 2 3 6 1,008,493 2,016,986 3,025,479 6,050,958

Collatz Trajectory (90 steps to reach 1)

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

6,050,958 3,025,479 9,076,438 4,538,219 13,614,658 6,807,329 20,421,988 10,210,994 5,105,497 15,316,492 7,658,246 3,829,123 11,487,370 5,743,685 17,231,056 8,615,528 4,307,764 2,153,882 1,076,941 3,230,824 1,615,412 807,706 403,853 1,211,560 605,780 302,890 151,445 454,336 227,168 113,584 56,792 28,396 14,198 7,099 21,298 10,649 31,948 15,974 7,987 23,962 11,981 35,944 17,972 8,986 4,493 13,480 6,740 3,370 1,685 5,056 2,528 1,264 632 316 158 79 238 119 358 179

← Previous Integer #6,050,957 Browse Full Index Next Integer #6,050,959 →