669,138

2 × 3 × 229 × 487

669,138 factors as 2 × 3 × 229 × 487. Its 16 positive divisors give a proper-divisor sum of 677,742, so this integer is abundant. The Collatz stopping time is 92 steps.

Prime Factor Structure

Factorization String 2 × 3 × 229 × 487

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 1,346,880

Proper Divisor Sum 677,742

Digit Sum / Digital Root 33 (Root: 6)

Adjacent Primes #669133 ← → #669167

Radix Representation

Decimal	669138
Binary	10100011010111010010 (20 bits)
Octal	0o2432722
Hexadecimal	0xA35D2

Divisor Catalog (16)

1 2 3 6 229 458 487 687 974 1,374 1,461 2,922 111,523 223,046 334,569 669,138

Collatz Trajectory (92 steps to reach 1)

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

669,138 334,569 1,003,708 501,854 250,927 752,782 376,391 1,129,174 564,587 1,693,762 846,881 2,540,644 1,270,322 635,161 1,905,484 952,742 476,371 1,429,114 714,557 2,143,672 1,071,836 535,918 267,959 803,878 401,939 1,205,818 602,909 1,808,728 904,364 452,182 226,091 678,274 339,137 1,017,412 508,706 254,353 763,060 381,530 190,765 572,296 286,148 143,074 71,537 214,612 107,306 53,653 160,960 80,480 40,240 20,120 10,060 5,030 2,515 7,546 3,773 11,320 5,660 2,830 1,415 4,246

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #669,137 Browse Full Index Next Integer #669,139 →