6,213,774

2 × 3 × 7 × 197 × 751

6,213,774 factors as 2 × 3 × 7 × 197 × 751. Its 32 positive divisors give a proper-divisor sum of 8,080,242, so this integer is abundant. The Collatz stopping time is 258 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 197 × 751

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 14,294,016

Proper Divisor Sum 8,080,242

Digit Sum / Digital Root 30 (Root: 3)

Adjacent Primes #6213769 ← → #6213787

Radix Representation

Decimal	6213774
Binary	10111101101000010001110 (23 bits)
Octal	0o27550216
Hexadecimal	0x5ED08E

Divisor Catalog (32)

1 2 3 6 7 14 21 42 197 394 591 751 1,182 1,379 1,502 2,253 2,758 4,137 4,506 5,257 8,274 10,514 15,771 31,542 147,947 295,894 443,841 887,682 1,035,629 2,071,258 3,106,887 6,213,774

Collatz Trajectory (258 steps to reach 1)

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

6,213,774 3,106,887 9,320,662 4,660,331 13,980,994 6,990,497 20,971,492 10,485,746 5,242,873 15,728,620 7,864,310 3,932,155 11,796,466 5,898,233 17,694,700 8,847,350 4,423,675 13,271,026 6,635,513 19,906,540 9,953,270 4,976,635 14,929,906 7,464,953 22,394,860 11,197,430 5,598,715 16,796,146 8,398,073 25,194,220 12,597,110 6,298,555 18,895,666 9,447,833 28,343,500 14,171,750 7,085,875 21,257,626 10,628,813 31,886,440 15,943,220 7,971,610 3,985,805 11,957,416 5,978,708 2,989,354 1,494,677 4,484,032 2,242,016 1,121,008 560,504 280,252 140,126 70,063 210,190 105,095 315,286 157,643 472,930 236,465

← Previous Integer #6,213,773 Browse Full Index Next Integer #6,213,775 →