668,408

2³ × 13 × 6427

668,408 factors as 2^3 × 13 × 6427. Its 16 positive divisors give a proper-divisor sum of 681,472, so this integer is abundant. The Collatz stopping time is 66 steps.

Prime Factor Structure

Factorization String 2^3 × 13 × 6427

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,349,880

Proper Divisor Sum 681,472

Digit Sum / Digital Root 32 (Root: 5)

Adjacent Primes #668407 ← → #668417

Radix Representation

Decimal	668408
Binary	10100011001011111000 (20 bits)
Octal	0o2431370
Hexadecimal	0xA32F8

Divisor Catalog (16)

1 2 4 8 13 26 52 104 6,427 12,854 25,708 51,416 83,551 167,102 334,204 668,408

Collatz Trajectory (66 steps to reach 1)

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

668,408 334,204 167,102 83,551 250,654 125,327 375,982 187,991 563,974 281,987 845,962 422,981 1,268,944 634,472 317,236 158,618 79,309 237,928 118,964 59,482 29,741 89,224 44,612 22,306 11,153 33,460 16,730 8,365 25,096 12,548 6,274 3,137 9,412 4,706 2,353 7,060 3,530 1,765 5,296 2,648 1,324 662 331 994 497 1,492 746 373 1,120 560 280 140 70 35 106 53 160 80 40 20

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #668,407 Browse Full Index Next Integer #668,409 →