1,481,262

2 × 3 × 29 × 8513

1,481,262 factors as 2 × 3 × 29 × 8513. Its 16 positive divisors give a proper-divisor sum of 1,583,778, so this integer is abundant. The Collatz stopping time is 62 steps.

Prime Factor Structure

Factorization String 2 × 3 × 29 × 8513

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 16

Divisor Sum (σ) 3,065,040

Proper Divisor Sum 1,583,778

Digit Sum / Digital Root 24 (Root: 6)

Adjacent Primes #1481257 ← → #1481281

Radix Representation

Decimal	1481262
Binary	101101001101000101110 (21 bits)
Octal	0o5515056
Hexadecimal	0x169A2E

Divisor Catalog (16)

1 2 3 6 29 58 87 174 8,513 17,026 25,539 51,078 246,877 493,754 740,631 1,481,262

Collatz Trajectory (62 steps to reach 1)

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

1,481,262 740,631 2,221,894 1,110,947 3,332,842 1,666,421 4,999,264 2,499,632 1,249,816 624,908 312,454 156,227 468,682 234,341 703,024 351,512 175,756 87,878 43,939 131,818 65,909 197,728 98,864 49,432 24,716 12,358 6,179 18,538 9,269 27,808 13,904 6,952 3,476 1,738 869 2,608 1,304 652 326 163 490 245 736 368 184 92 46 23 70 35 106 53 160 80 40 20 10 5 16 8

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #1,481,261 Browse Full Index Next Integer #1,481,263 →