9,500,051

11 × 863641

9,500,051 factors as 11 × 863641. Its 4 positive divisors give a proper-divisor sum of 863,653, so this integer is deficient. The Collatz stopping time is 176 steps.

Prime Factor Structure

Factorization String 11 × 863641

Distinct Prime Factors 2

Square Status No

Abundance Measure Deficient

Analytical Properties

Total Divisors 4

Divisor Sum (σ) 10,363,704

Proper Divisor Sum 863,653

Digit Sum / Digital Root 20 (Root: 2)

Adjacent Primes #9500047 ← → #9500089

Radix Representation

Decimal	9500051
Binary	100100001111010110010011 (24 bits)
Octal	0o44172623
Hexadecimal	0x90F593

Divisor Catalog (4)

1 11 863,641 9,500,051

Collatz Trajectory (176 steps to reach 1)

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

9,500,051 28,500,154 14,250,077 42,750,232 21,375,116 10,687,558 5,343,779 16,031,338 8,015,669 24,047,008 12,023,504 6,011,752 3,005,876 1,502,938 751,469 2,254,408 1,127,204 563,602 281,801 845,404 422,702 211,351 634,054 317,027 951,082 475,541 1,426,624 713,312 356,656 178,328 89,164 44,582 22,291 66,874 33,437 100,312 50,156 25,078 12,539 37,618 18,809 56,428 28,214 14,107 42,322 21,161 63,484 31,742 15,871 47,614 23,807 71,422 35,711 107,134 53,567 160,702 80,351 241,054 120,527 361,582

← Previous Integer #9,500,050 Browse Full Index Next Integer #9,500,052 →