9,049,994

2 × 23 × 196739

9,049,994 factors as 2 × 23 × 196739. Its 8 positive divisors give a proper-divisor sum of 5,115,286, so this integer is deficient. The Collatz stopping time is 88 steps.

Prime Factor Structure

Factorization String 2 × 23 × 196739

Distinct Prime Factors 3

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 8

Divisor Sum (σ) 14,165,280

Proper Divisor Sum 5,115,286

Digit Sum / Digital Root 44 (Root: 8)

Adjacent Primes #9049987 ← → #9050039

Radix Representation

Decimal	9049994
Binary	100010100001011110001010 (24 bits)
Octal	0o42413612
Hexadecimal	0x8A178A

Divisor Catalog (8)

1 2 23 46 196,739 393,478 4,524,997 9,049,994

Collatz Trajectory (88 steps to reach 1)

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

9,049,994 4,524,997 13,574,992 6,787,496 3,393,748 1,696,874 848,437 2,545,312 1,272,656 636,328 318,164 159,082 79,541 238,624 119,312 59,656 29,828 14,914 7,457 22,372 11,186 5,593 16,780 8,390 4,195 12,586 6,293 18,880 9,440 4,720 2,360 1,180 590 295 886 443 1,330 665 1,996 998 499 1,498 749 2,248 1,124 562 281 844 422 211 634 317 952 476 238 119 358 179 538 269

← Previous Integer #9,049,993 Browse Full Index Next Integer #9,049,995 →