1,313,637

3 × 13² × 2591

1,313,637 factors as 3 × 13^2 × 2591. Its 12 positive divisors give a proper-divisor sum of 583,707, so this integer is deficient. The Collatz stopping time is 67 steps.

Prime Factor Structure

Factorization String 3 × 13^2 × 2591

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 12

Divisor Sum (σ) 1,897,344

Proper Divisor Sum 583,707

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1313633 ← → #1313651

Radix Representation

Decimal	1313637
Binary	101000000101101100101 (21 bits)
Octal	0o5005545
Hexadecimal	0x140B65

Divisor Catalog (12)

1 3 13 39 169 507 2,591 7,773 33,683 101,049 437,879 1,313,637

Collatz Trajectory (67 steps to reach 1)

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

1,313,637 3,940,912 1,970,456 985,228 492,614 246,307 738,922 369,461 1,108,384 554,192 277,096 138,548 69,274 34,637 103,912 51,956 25,978 12,989 38,968 19,484 9,742 4,871 14,614 7,307 21,922 10,961 32,884 16,442 8,221 24,664 12,332 6,166 3,083 9,250 4,625 13,876 6,938 3,469 10,408 5,204 2,602 1,301 3,904 1,952 976 488 244 122 61 184 92 46 23 70 35 106 53 160 80 40

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,313,636 Browse Full Index Next Integer #1,313,638 →