1,244,802

2 × 3 × 13 × 15959

1,244,802 factors as 2 × 3 × 13 × 15959. Its 16 positive divisors give a proper-divisor sum of 1,436,478, so this integer is abundant. The Collatz stopping time is 80 steps.

Prime Factor Structure

Factorization String 2 × 3 × 13 × 15959

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 2,681,280

Proper Divisor Sum 1,436,478

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #1244797 ← → #1244813

Radix Representation

Decimal	1244802
Binary	100101111111010000010 (21 bits)
Octal	0o4577202
Hexadecimal	0x12FE82

Divisor Catalog (16)

1 2 3 6 13 26 39 78 15,959 31,918 47,877 95,754 207,467 414,934 622,401 1,244,802

Collatz Trajectory (80 steps to reach 1)

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

1,244,802 622,401 1,867,204 933,602 466,801 1,400,404 700,202 350,101 1,050,304 525,152 262,576 131,288 65,644 32,822 16,411 49,234 24,617 73,852 36,926 18,463 55,390 27,695 83,086 41,543 124,630 62,315 186,946 93,473 280,420 140,210 70,105 210,316 105,158 52,579 157,738 78,869 236,608 118,304 59,152 29,576 14,788 7,394 3,697 11,092 5,546 2,773 8,320 4,160 2,080 1,040 520 260 130 65 196 98 49 148 74 37

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,244,801 Browse Full Index Next Integer #1,244,803 →