6,208,746

2 × 3 × 1034791

6,208,746 factors as 2 × 3 × 1034791. Its 8 positive divisors give a proper-divisor sum of 6,208,758, so this integer is abundant. The Collatz stopping time is 90 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1034791

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 12,417,504

Proper Divisor Sum 6,208,758

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #6208733 ← → #6208759

Radix Representation

Decimal	6208746
Binary	10111101011110011101010 (23 bits)
Octal	0o27536352
Hexadecimal	0x5EBCEA

Divisor Catalog (8)

1 2 3 6 1,034,791 2,069,582 3,104,373 6,208,746

Collatz Trajectory (90 steps to reach 1)

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

6,208,746 3,104,373 9,313,120 4,656,560 2,328,280 1,164,140 582,070 291,035 873,106 436,553 1,309,660 654,830 327,415 982,246 491,123 1,473,370 736,685 2,210,056 1,105,028 552,514 276,257 828,772 414,386 207,193 621,580 310,790 155,395 466,186 233,093 699,280 349,640 174,820 87,410 43,705 131,116 65,558 32,779 98,338 49,169 147,508 73,754 36,877 110,632 55,316 27,658 13,829 41,488 20,744 10,372 5,186 2,593 7,780 3,890 1,945 5,836 2,918 1,459 4,378 2,189 6,568

← Previous Integer #6,208,745 Browse Full Index Next Integer #6,208,747 →