8,892,990

2 × 3⁴ × 5 × 10979

8,892,990 factors as 2 × 3^4 × 5 × 10979. Its 40 positive divisors give a proper-divisor sum of 15,021,450, so this integer is abundant. The Collatz stopping time is 142 steps.

Prime Factor Structure

Factorization String 2 × 3^4 × 5 × 10979

Distinct Prime Factors 4

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 40

Divisor Sum (σ) 23,914,440

Proper Divisor Sum 15,021,450

Digit Sum / Digital Root 45 (Root: 9)

Adjacent Primes #8892907 ← → #8892991

Radix Representation

Decimal	8892990
Binary	100001111011001000111110 (24 bits)
Octal	0o41731076
Hexadecimal	0x87B23E

Divisor Catalog (40)

1 2 3 5 6 9 10 15 18 27 30 45 54 81 90 135 162 270 405 810 10,979 21,958 32,937 54,895 65,874 98,811 109,790 164,685 197,622 296,433 329,370 494,055 592,866 889,299 988,110 1,482,165 1,778,598 2,964,330 4,446,495 8,892,990

Collatz Trajectory (142 steps to reach 1)

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

8,892,990 4,446,495 13,339,486 6,669,743 20,009,230 10,004,615 30,013,846 15,006,923 45,020,770 22,510,385 67,531,156 33,765,578 16,882,789 50,648,368 25,324,184 12,662,092 6,331,046 3,165,523 9,496,570 4,748,285 14,244,856 7,122,428 3,561,214 1,780,607 5,341,822 2,670,911 8,012,734 4,006,367 12,019,102 6,009,551 18,028,654 9,014,327 27,042,982 13,521,491 40,564,474 20,282,237 60,846,712 30,423,356 15,211,678 7,605,839 22,817,518 11,408,759 34,226,278 17,113,139 51,339,418 25,669,709 77,009,128 38,504,564 19,252,282 9,626,141 28,878,424 14,439,212 7,219,606 3,609,803 10,829,410 5,414,705 16,244,116 8,122,058 4,061,029 12,183,088

← Previous Integer #8,892,989 Browse Full Index Next Integer #8,892,991 →