669,762

2 × 3³ × 79 × 157

669,762 factors as 2 × 3^3 × 79 × 157. Its 32 positive divisors give a proper-divisor sum of 847,038, so this integer is abundant. The Collatz stopping time is 154 steps.

Prime Factor Structure

Factorization String 2 × 3^3 × 79 × 157

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 1,516,800

Proper Divisor Sum 847,038

Digit Sum / Digital Root 36 (Root: 9)

Adjacent Primes #669733 ← → #669763

Radix Representation

Decimal	669762
Binary	10100011100001000010 (20 bits)
Octal	0o2434102
Hexadecimal	0xA3842

Divisor Catalog (32)

1 2 3 6 9 18 27 54 79 157 158 237 314 471 474 711 942 1,413 1,422 2,133 2,826 4,239 4,266 8,478 12,403 24,806 37,209 74,418 111,627 223,254 334,881 669,762

Collatz Trajectory (154 steps to reach 1)

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

669,762 334,881 1,004,644 502,322 251,161 753,484 376,742 188,371 565,114 282,557 847,672 423,836 211,918 105,959 317,878 158,939 476,818 238,409 715,228 357,614 178,807 536,422 268,211 804,634 402,317 1,206,952 603,476 301,738 150,869 452,608 226,304 113,152 56,576 28,288 14,144 7,072 3,536 1,768 884 442 221 664 332 166 83 250 125 376 188 94 47 142 71 214 107 322 161 484 242 121

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #669,761 Browse Full Index Next Integer #669,763 →