10,126,470

2 × 3 × 5 × 227 × 1487

10,126,470 factors as 2 × 3 × 5 × 227 × 1487. Its 32 positive divisors give a proper-divisor sum of 14,300,538, so this integer is abundant. The Collatz stopping time is 114 steps.

Prime Factor Structure

Factorization String 2 × 3 × 5 × 227 × 1487

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 24,427,008

Proper Divisor Sum 14,300,538

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #10126469 ← → #10126477

Radix Representation

Decimal	10126470
Binary	100110101000010010000110 (24 bits)
Octal	0o46502206
Hexadecimal	0x9A8486

Divisor Catalog (32)

Collatz Trajectory (114 steps to reach 1)

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

10,126,470 5,063,235 15,189,706 7,594,853 22,784,560 11,392,280 5,696,140 2,848,070 1,424,035 4,272,106 2,136,053 6,408,160 3,204,080 1,602,040 801,020 400,510 200,255 600,766 300,383 901,150 450,575 1,351,726 675,863 2,027,590 1,013,795 3,041,386 1,520,693 4,562,080 2,281,040 1,140,520 570,260 285,130 142,565 427,696 213,848 106,924 53,462 26,731 80,194 40,097 120,292 60,146 30,073 90,220 45,110 22,555 67,666 33,833 101,500 50,750 25,375 76,126 38,063 114,190 57,095 171,286 85,643 256,930 128,465 385,396

More profiles

Browse other published profiles and their separate link collections.

No other profiles in this collection.

← Previous Integer #10,126,469 Browse Full Index Next Integer #10,126,471 →