10,240,122

2 × 3 × 1706687

10,240,122 factors as 2 × 3 × 1706687. Its 8 positive divisors give a proper-divisor sum of 10,240,134, so this integer is abundant. The Collatz stopping time is 75 steps.

Prime Factor Structure

Factorization String 2 × 3 × 1706687

Distinct Prime Factors 3

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 20,480,256

Proper Divisor Sum 10,240,134

Digit Sum / Digital Root 12 (Root: 3)

Adjacent Primes #10240121 ← → #10240123

Radix Representation

Decimal	10240122
Binary	100111000100000001111010 (24 bits)
Octal	0o47040172
Hexadecimal	0x9C407A

Divisor Catalog (8)

1 2 3 6 1,706,687 3,413,374 5,120,061 10,240,122

Collatz Trajectory (75 steps to reach 1)

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

10,240,122 5,120,061 15,360,184 7,680,092 3,840,046 1,920,023 5,760,070 2,880,035 8,640,106 4,320,053 12,960,160 6,480,080 3,240,040 1,620,020 810,010 405,005 1,215,016 607,508 303,754 151,877 455,632 227,816 113,908 56,954 28,477 85,432 42,716 21,358 10,679 32,038 16,019 48,058 24,029 72,088 36,044 18,022 9,011 27,034 13,517 40,552 20,276 10,138 5,069 15,208 7,604 3,802 1,901 5,704 2,852 1,426 713 2,140 1,070 535 1,606 803 2,410 1,205 3,616 1,808

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #10,240,121 Browse Full Index Next Integer #10,240,123 →