9,141,060

2² × 3 × 5 × 73 × 2087

9,141,060 factors as 2^2 × 3 × 5 × 73 × 2087. Its 48 positive divisors give a proper-divisor sum of 16,816,956, so this integer is abundant. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2^2 × 3 × 5 × 73 × 2087

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 48

Divisor Sum (σ) 25,958,016

Proper Divisor Sum 16,816,956

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #9141031 ← → #9141089

Radix Representation

Decimal	9141060
Binary	100010110111101101000100 (24 bits)
Octal	0o42675504
Hexadecimal	0x8B7B44

Divisor Catalog (48)

1 2 3 4 5 6 10 12 15 20 30 60 73 146 219 292 365 438 730 876 1,095 1,460 2,087 2,190 4,174 4,380 6,261 8,348 10,435 12,522 20,870 25,044 31,305 41,740 62,610 125,220 152,351 304,702 457,053 609,404 761,755 914,106 1,523,510 1,828,212 2,285,265 3,047,020 4,570,530 9,141,060

Collatz Trajectory (88 steps to reach 1)

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

9,141,060 4,570,530 2,285,265 6,855,796 3,427,898 1,713,949 5,141,848 2,570,924 1,285,462 642,731 1,928,194 964,097 2,892,292 1,446,146 723,073 2,169,220 1,084,610 542,305 1,626,916 813,458 406,729 1,220,188 610,094 305,047 915,142 457,571 1,372,714 686,357 2,059,072 1,029,536 514,768 257,384 128,692 64,346 32,173 96,520 48,260 24,130 12,065 36,196 18,098 9,049 27,148 13,574 6,787 20,362 10,181 30,544 15,272 7,636 3,818 1,909 5,728 2,864 1,432 716 358 179 538 269

← Previous Integer #9,141,059 Browse Full Index Next Integer #9,141,061 →