1,444,602

2 × 3 × 61 × 3947

1,444,602 factors as 2 × 3 × 61 × 3947. Its 16 positive divisors give a proper-divisor sum of 1,492,710, so this integer is abundant. The Collatz stopping time is 119 steps.

Prime Factor Structure

Factorization String 2 × 3 × 61 × 3947

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,937,312

Proper Divisor Sum 1,492,710

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1444571 ← → #1444613

Radix Representation

Decimal	1444602
Binary	101100000101011111010 (21 bits)
Octal	0o5405372
Hexadecimal	0x160AFA

Divisor Catalog (16)

1 2 3 6 61 122 183 366 3,947 7,894 11,841 23,682 240,767 481,534 722,301 1,444,602

Collatz Trajectory (119 steps to reach 1)

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

1,444,602 722,301 2,166,904 1,083,452 541,726 270,863 812,590 406,295 1,218,886 609,443 1,828,330 914,165 2,742,496 1,371,248 685,624 342,812 171,406 85,703 257,110 128,555 385,666 192,833 578,500 289,250 144,625 433,876 216,938 108,469 325,408 162,704 81,352 40,676 20,338 10,169 30,508 15,254 7,627 22,882 11,441 34,324 17,162 8,581 25,744 12,872 6,436 3,218 1,609 4,828 2,414 1,207 3,622 1,811 5,434 2,717 8,152 4,076 2,038 1,019 3,058 1,529

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,444,601 Browse Full Index Next Integer #1,444,603 →