668,778

2 × 3 × 11 × 10133

668,778 factors as 2 × 3 × 11 × 10133. Its 16 positive divisors give a proper-divisor sum of 790,518, so this integer is abundant. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 2 × 3 × 11 × 10133

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,459,296

Proper Divisor Sum 790,518

Digit Sum / Digital Root 42 (Root: 6)

Adjacent Primes #668761 ← → #668791

Radix Representation

Decimal	668778
Binary	10100011010001101010 (20 bits)
Octal	0o2432152
Hexadecimal	0xA346A

Divisor Catalog (16)

1 2 3 6 11 22 33 66 10,133 20,266 30,399 60,798 111,463 222,926 334,389 668,778

Collatz Trajectory (92 steps to reach 1)

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

668,778 334,389 1,003,168 501,584 250,792 125,396 62,698 31,349 94,048 47,024 23,512 11,756 5,878 2,939 8,818 4,409 13,228 6,614 3,307 9,922 4,961 14,884 7,442 3,721 11,164 5,582 2,791 8,374 4,187 12,562 6,281 18,844 9,422 4,711 14,134 7,067 21,202 10,601 31,804 15,902 7,951 23,854 11,927 35,782 17,891 53,674 26,837 80,512 40,256 20,128 10,064 5,032 2,516 1,258 629 1,888 944 472 236 118

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #668,777 Browse Full Index Next Integer #668,779 →