1,340,652

2² × 3 × 111721

1,340,652 factors as 2^2 × 3 × 111721. Its 12 positive divisors give a proper-divisor sum of 1,787,564, so this integer is abundant. The Collatz stopping time is 93 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 111721

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 3,128,216

Proper Divisor Sum 1,787,564

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1340639 ← → #1340653

Radix Representation

Decimal	1340652
Binary	101000111010011101100 (21 bits)
Octal	0o5072354
Hexadecimal	0x1474EC

Divisor Catalog (12)

1 2 3 4 6 12 111,721 223,442 335,163 446,884 670,326 1,340,652

Collatz Trajectory (93 steps to reach 1)

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

1,340,652 670,326 335,163 1,005,490 502,745 1,508,236 754,118 377,059 1,131,178 565,589 1,696,768 848,384 424,192 212,096 106,048 53,024 26,512 13,256 6,628 3,314 1,657 4,972 2,486 1,243 3,730 1,865 5,596 2,798 1,399 4,198 2,099 6,298 3,149 9,448 4,724 2,362 1,181 3,544 1,772 886 443 1,330 665 1,996 998 499 1,498 749 2,248 1,124 562 281 844 422 211 634 317 952 476 238

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,340,651 Browse Full Index Next Integer #1,340,653 →