9,000,138

2 × 3 × 7 × 421 × 509

9,000,138 factors as 2 × 3 × 7 × 421 × 509. Its 32 positive divisors give a proper-divisor sum of 11,660,982, so this integer is abundant. The Collatz stopping time is 111 steps.

Prime Factor Structure

Factorization String 2 × 3 × 7 × 421 × 509

Distinct Prime Factors 5

Square Status No

Abundance Measure Abundant

Analytical Properties

Total Divisors 32

Divisor Sum (σ) 20,661,120

Proper Divisor Sum 11,660,982

Digit Sum / Digital Root 21 (Root: 3)

Adjacent Primes #9000127 ← → #9000143

Radix Representation

Decimal	9000138
Binary	100010010101010011001010 (24 bits)
Octal	0o42252312
Hexadecimal	0x8954CA

Divisor Catalog (32)

1 2 3 6 7 14 21 42 421 509 842 1,018 1,263 1,527 2,526 2,947 3,054 3,563 5,894 7,126 8,841 10,689 17,682 21,378 214,289 428,578 642,867 1,285,734 1,500,023 3,000,046 4,500,069 9,000,138

Collatz Trajectory (111 steps to reach 1)

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

9,000,138 4,500,069 13,500,208 6,750,104 3,375,052 1,687,526 843,763 2,531,290 1,265,645 3,796,936 1,898,468 949,234 474,617 1,423,852 711,926 355,963 1,067,890 533,945 1,601,836 800,918 400,459 1,201,378 600,689 1,802,068 901,034 450,517 1,351,552 675,776 337,888 168,944 84,472 42,236 21,118 10,559 31,678 15,839 47,518 23,759 71,278 35,639 106,918 53,459 160,378 80,189 240,568 120,284 60,142 30,071 90,214 45,107 135,322 67,661 202,984 101,492 50,746 25,373 76,120 38,060 19,030 9,515

← Previous Integer #9,000,137 Browse Full Index Next Integer #9,000,139 →