9,050,689

1951 × 4639

9,050,689 factors as 1951 × 4639. Its 4 positive divisors give a proper-divisor sum of 6,591, so this integer is deficient. The Collatz stopping time is 132 steps.

Prime Factor Structure

Factorization String 1951 × 4639

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 9,057,280

Proper Divisor Sum 6,591

Digit Sum / Digital Root 37 (Root: 1)

Adjacent Primes #9050687 ← → #9050731

Radix Representation

Decimal	9050689
Binary	100010100001101001000001 (24 bits)
Octal	0o42415101
Hexadecimal	0x8A1A41

Divisor Catalog (4)

1 1,951 4,639 9,050,689

Collatz Trajectory (132 steps to reach 1)

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

9,050,689 27,152,068 13,576,034 6,788,017 20,364,052 10,182,026 5,091,013 15,273,040 7,636,520 3,818,260 1,909,130 954,565 2,863,696 1,431,848 715,924 357,962 178,981 536,944 268,472 134,236 67,118 33,559 100,678 50,339 151,018 75,509 226,528 113,264 56,632 28,316 14,158 7,079 21,238 10,619 31,858 15,929 47,788 23,894 11,947 35,842 17,921 53,764 26,882 13,441 40,324 20,162 10,081 30,244 15,122 7,561 22,684 11,342 5,671 17,014 8,507 25,522 12,761 38,284 19,142 9,571

← Previous Integer #9,050,688 Browse Full Index Next Integer #9,050,690 →